#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           using namespace std;#define N 1100#define INF 0x7fffffffbool prime[N]; void init(){ memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; int m = (int)sqrt(N+0.5); for(int i=2; i<=m; i++){ if(prime[i]) for(int j=i*i; j<=N; j+=i) prime[j] = false; }} int main(){ //freopen("d:\\in.txt", "r", stdin); int t, n; scanf("%d", &t); init(); while(t--) { scanf("%d", &n); for(int i=0; true; i++){ if(prime[i+n]){ printf("%d\n", i+n); break; } else if(n-i > 0 && prime[n-i]){ printf("%d\n", n-i); break; } } } return 0;}