CodeForces - 194B —B. Square

B. Square

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a square painted on a piece of paper, the square's side equals n meters. John Doe draws crosses on the square's perimeter. John paints the first cross in the lower left corner of the square. Then John moves along the square's perimeter in the clockwise direction (first upwards, then to the right, then downwards, then to the left and so on). Every time he walks (n + 1) meters, he draws a cross (see picture for clarifications).

John Doe stops only when the lower left corner of the square has two crosses. How many crosses will John draw?

The figure shows the order in which John draws crosses for a square with side 4. The lower left square has two crosses. Overall John paints 17 crosses.

Input

The first line contains integer t (1 ≤ t ≤ 104) — the number of test cases.

The second line contains t space-separated integers ni (1 ≤ ni ≤ 109) — the sides of the square for each test sample.

Output

For each test sample print on a single line the answer to it, that is, the number of crosses John will draw as he will move along the square of the corresponding size. Print the answers to the samples in the order in which the samples are given in the input.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Examples

input

3
4 8 100

output

17
33
401

求4*n和n+1的最小公倍数

#include<stdio.h>
long long gcd(long long a,long long b)//greatest common divisor
{   while(b!=0)
    {long long c=a%b;
         a=b;
         b=c;
    }
    return a;
}
long long lcm(long long a,long long b)
{
    return a/gcd(a,b)*b;
}
int main()
{
    long long n,m;
    long long t[10001];
    while(scanf("%lld",&m)!=EOF)
    {
        for(int i=0;i<m;i++)
        {
            scanf("%lld",&t[i]);
        }

        for(int i=0;i<m;i++)
        {
            long long ans=(lcm(4*t[i],t[i]+1)/(t[i]+1))+1;
            printf("%lld\n",ans);
        }

    }
}