/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
vector<bool>prim(100003,false);
vector<int>p;
void seive()
{
    for(int i=2;i<=1000;i++)
    {
        if(prim[i]) continue;
        for(int j=i+i;j<=100000;j+=i) prim[j]=true;
    }

    for(int i=2;i<=100000;i++)
    {
        if(!prim[i]) 
            p.push_back(i);
    }
}

void solve()
{
    int n; cin>>n;
    for(auto &e:p)
    {
        if(n%e==0)
        {
            cout<<n/e<<endl;
            return;
        }
    }
    cout<<1<<endl;
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    seive();
    //for(int i=0;i<100;i++) cout<<p[i]<<" "; cout<<endl;
    int t; cin>>t; while(t--) solve();
}