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

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(){
    const int N = 1e7+10;
    vector<bool>isPrime(N,1);
    isPrime[0] = isPrime[1] = false;          
    for (int i = 2; i < N; i++){             
        if (isPrime[i] == true){   
            for (int j = 2 * i;j < N; j+=i){
                isPrime[j] = false;             
            }
        }
    }

    long long 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{
            long long int ans = max_div(n);
            cout << ans << endl;
        }
    }
}