Maximum GCD

A. Maximum GCD

Problem

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 $\gcd (a,b)$, where KaTeX parse error: Expected 'EOF', got '&' at position 10: 1 \leq a &̲lt; b \leq n.

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

Input

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

Output

For each test case, output the maximum value of $\gcd (a,b)$ among all KaTeX parse error: Expected 'EOF', got '&' at position 10: 1 \leq a &̲lt; b \leq n.

Example

Input

2
3
5

Output

1
2

Note

In the first test case, $\gcd (1,2)=\gcd (2,3)=\gcd (1,3)=1$.

In the second test case, $2$ is the maximum possible value, corresponding to $\gcd (2,4)$.

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>


using namespace std;

typedef long long ll;

void solve()
{
    ll n;
    cin>>n;
    cout<<n/2<<endl;
}

int main()
{
    ll t;
    cin>>t;

    while(t--) solve();
    
    return 0;
}