Maximum GCD Problem !!!

 PROBLEM 21: Maximum GCD

Problem Reference : Codeforces 

Let's consider all integers in the range from 1$1$ to n$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 gcd(a,b)$\mathrm{g}\mathrm{c}\mathrm{d}(a,b)$, where 1≤a<b≤n$1\le a<b\le n$.

The greatest common divisor, gcd(a,b)$\mathrm{g}\mathrm{c}\mathrm{d}(a,b)$, of two positive integers a$a$ and b$b$ is the biggest integer that is a divisor of both a$a$ and b$b$.

Input:

The first line contains a single integer t$t$ (1≤t≤100$1\le t\le 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$n$ (2≤n≤106$2\le n\le {10}^6$).

Output:

For each test case, output the maximum value of gcd(a,b)$\mathrm{g}\mathrm{c}\mathrm{d}(a,b)$ among all 1≤a<b≤n$1\le a<b\le n$.

Solution: 

1. t = int(input())
2. i = 0
3. while i < t:
4. n = int(input())
5. n1 = n // 2
6. print(n1)
7. i += 1

The above solution is in python language.

Example

input

2
3
5

output

1
2