//Fahmidur Rahman Nafi 62 [i]
#include <bits/stdc++.h>
using namespace std;

vector<bool>sieve(int num) {
    const int N = num + 1;
    vector<bool> isPrime(N, 1);
    isPrime[0] = isPrime[1] = false;

    for (int i = 2; i < N; ++i) {
        if (isPrime[i]) {
            for (int j = 2 * i; j < N; j += i) {
                isPrime[j] = false;
            }
        }
    }
    return isPrime;
}

int max_div(long long int num) {
    long long int highest = 1;
    //long long int x = num / 2;
    for (long long int i = sqrt(num); i >= 1; i--) {
        if (num % i == 0) {
            return num / i;
        }
    }
    return highest;
}

int main(){
    long long int t;
    cin >> t;
    while (t--){
        long long int n;
        cin >> n;
        
        if (n % 2 == 0){
            cout << n/2 << endl;
        }
        else if (sieve(n)[n]){
            cout << 1 << endl;
        }
        else{
            long long int ans = max_div(n);
            cout << ans << endl;
        }
    }
}