//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;

bool is_prime(int n) {// O(sqrt(n))

    for(int i = 2; i * i <=n; i++) {
        if(n%i==0) {
            return false;
        }
    }
    return true;
}

void s()
{
    int n;
    cin >> n;
    if(n%2==0) {
        cout << n/2 << endl;
    }
    else if(is_prime(n)) {
        cout << "1" << endl;
    }
    else {
        for (int i = 3; i <= sqrt(n); i+=2) {
            if (n % i == 0) {
                cout << i << endl;
                return;
            }
        }
    }
}
int32_t main()
{   ios::sync_with_stdio(false);
    TC
    s();


}