#include <bits/stdc++.h>
using namespace std;

const int MAX = 1e6 + 5;
vector<bool> isPrime(MAX, true);

void sieve(){
    isPrime[0] = isPrime[1] = false;
    for (int i = 2; i * i < MAX; ++i){
        if (isPrime[i]) {
            for (int j = i * i; j < MAX; j += i){
                isPrime[j] = false;
            }
        }
    }
}

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


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    sieve();

    int t;
    cin >> t;
    while (t--) {
        long long int n;
        cin >> n;

        if (n % 2 == 0){
            cout << n / 2 << endl;
        }
        else if (isPrime[n]){
            cout << 1 << endl;
        } 
        else {
            cout << max_div(n) << endl;
        }
    }
    return 0;
}