func_code_string: #include<bits/stdc++.h>   #define int long long   #define reg register   using namespace std;   const int maxn=5e5+5;   const int mod=1e9+7;   const int INF=2e9;   inline int read()   {       int x=0,f=1;       char ch=getchar();       while(ch< 0  || ch> 9 )       {           if(ch== - )           f=-1;           ch=getchar();       }       while(ch>= 0  && ch<= 9 )       {           x=x*10+ch- 0 ;           ch=getchar();       }       return x*f;   }   int T;   int d;   int prime[maxn];   int tot=0;   int check[maxn];   void Pre(int maxx)   {    check[1]=1;    for(int i=2;i<=maxx;i++)    {     if(check[i]==0)     prime[++tot]=i;     for(int j=1;j<=tot && prime[j]*i<=maxx;j++)     {      check[i*prime[j]]=1;      if(i%prime[j]==0)      break;     }    }   }   signed main()   {     Pre(500000);    //for(int i=1;i<=20;i++)    //cout<<prime[i]<<   ;    T=read();    //cout<<tot<<endl;    while(T--)    {     d=read();    /* if(d==2)     {      printf( 15 n );      continue;     }     else     if(d==1)     {      printf( 6 n );      continue;     }*/     int l=1,r=tot;     while(l<r)     {      int mid=(l+r)>>1;      if(prime[mid]-1>=d)      r=mid;      else      l=mid+1;     }     int ans1=l;     //cout<<ans1<<endl;     l=ans1+1,r=tot;     while(l<r)     {      int mid=(l+r)>>1;      if(prime[mid]-prime[ans1]>=d)      r=mid;      else      l=mid+1;     }     int ans2=l;     printf( %lld n ,prime[ans1]*prime[ans2]);    }    return 0;   }   /*   4   3 3 2 1   6   3 4 5 1 6 2      0   */