write a go solution for Description:
Let's consider all integers in the range from 1 to n (inclusive).

Among all pairs of distinct integers in this range, find the maximum possible greatest common divisor of integers in pair. Formally, find the maximum value of mathrmgcd(a,b), where 1<=a<b<=n.

The greatest common divisor, mathrmgcd(a,b), of two positive integers a and b is the biggest integer that is a divisor of both a and b.

Input Format:
The first line contains a single integer t (1<=t<=100)  — the number of test cases. The description of the test cases follows.

The only line of each test case contains a single integer n (2<=n<=10^6).

Output Format:
For each test case, output the maximum value of mathrmgcd(a,b) among all 1<=a<b<=n.

Note:
In the first test case, mathrmgcd(1,2)=mathrmgcd(2,3)=mathrmgcd(1,3)=1.

In the second test case, 2 is the maximum possible value, corresponding to mathrmgcd(2,4).. Output only the code with no comments, explanation, or additional text.