/*
* Copyright (c) 2024 Emon Thakur
* All rights reserved.
*/
#include<bits/stdc++.h>
using namespace std;
bool prime[100002];
vector<int>p;
void seive()
{
for(int i=2;i<=1000;i++)
{
if(prime[i]) continue;
for(int j=i+i;j<=100000;j++) prime[j]=true;
}
for(int i=2;i<=100000;i++)
{
if(!prime[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();
int t; cin>>t; while(t--) solve();
}