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

long long t,n;
int x[1000011];

void sieve(int N) {
    for(int i=0;i<=N;++i)x[i]=1;
    x[0]=0;
    x[1]=0;
    for(int i=2;i*i<=N;++i)
        if(x[i]==1) for(int j=i*i;j<=N;j+=i)x[j]=0;
}
int main()
{
    freopen("CLOPRIME.inp","r",stdin);
    freopen("CLOPRIME.out","w",stdout);
    sieve(1000010);
    cin>>t;
    while(t--){
        cin>>n;
        while(x[n]==0)n--;
        cout<<n<<endl;
    }
}