#include<bits/stdc++.h>
#define FOR(x,a,b) for (int x=a;x<=b;x++)
#define FOD(x,a,b) for (int x=a;x>=b;x--)
#define pub push_back
#define pob pop_back
#define ii  pair<int,int>
#define pll pair<long long, long long>
#define F first
#define S second
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
typedef unsigned long long int ull;
typedef long long ll;
const long N=1e5 + 5;
const int mod = 1e9 +7;
using namespace std;
void solve(){
 bool kt[500005];
 memset(kt,true,sizeof(kt));
 kt[0]=kt[1]=false;
 for(int i=2;i*i<=500005;i++)
  if (kt[i])
   for (int j=i*i;j<=500005;j+=i)
    kt[j]=false;
 int n,x;
 cin>>n;
 for (int i=1;i<=n;i++){
  cin>>x;
  while (!kt[x])
   x--;
  cout<<x<<endl;
 }
}
int main(){
    fast;
     freopen("cloprime.inp","r",stdin);
     freopen("cloprime.out","w",stdout);
    solve();
    return 0;
}