func_code_string: #include <bits/stdc++.h>       #define PI 3.141592653589793238462643383279   #define EXP 2.71828182846       #define ll long long      using namespace std;      double log2(double n)   {    return log(n)/log(2);   }      double ln(double n)   {    return log(n)/log(EXP);   }       void Heap(signed long long int A[],signed long long int n,signed long long int l,signed long long int r)   {    signed long long int x,i,j;    x=A[l];    i=l;    while(1)    {     j=2*i;     if(j>r)break;     if(j<r&&A[j+1]>=A[j])     j++;     if(x>=A[j]) break;     A[i]=A[j];     i=j;    }    A[i]=x;   }       void HeapSort(signed long long int A[],signed long long int n)   {    signed long long int l,r,temp;    l=n/2;    while(l>=0)    {     Heap(A,n,l,n-1);     l--;    }    r=n-1;    while(r>=1)    {     temp=A[0];     A[0]=A[r];     A[r]=temp;     r--;     Heap(A,n,0,r);    }   }        bool issimple(unsigned long long n){     for(unsigned long long i=2;i<=sqrt(n);i++)     if(n%i==0)      return false;    return true;   }       long long nod(long long a,long long b)   {       long long temp;       while(b)       {           a%=b;           temp=a;           a=b;           b=temp;       }       return a;   }       long long nok(long long a,long long b,long long nod)   {       return a/nod*b;   }       unsigned long long fac(unsigned long long n)   {    unsigned long long f=1;    if(n==0||n==1) return f;    for(int i=2;i<=n;i++)    {     f*=i;    }    return f;   }       int bSearch(int A[],int n,int x)   {    int l=0,r=n-1,m,found=0,c=0;    while(l<=r)     {     m=(l+r)/2;     c++;     if(A[m]==x)      {      found=1;      break;     }     //c++;     if(A[m]<x) l=m+1;     else r=m-1;    }    if(found)     return c;    return 0;   }      map<long long int,long long int> factorize(long long x) {       map<long long int,long long int> factors;           for (int i = 2; i <= sqrt(x); i++) {           while (x % i == 0) {            if(factors.find(i)==factors.end())                factors.insert({i,1});               else                factors[i]++;               x /= i;           }       }           if (x != 1) {           if(factors.find(x)==factors.end())                factors.insert({x,1});               else                factors[x]++;       }           return factors;   }      void answer(bool yes)   {    yes? cout<< YES n :cout<< NO n ;   }      long long ab(long long val)   {    if(val<0) return -val;    return val;   }      bool even(long long number)   {    if (number & 1)        return 0; //íå÷åòíîå    else         return 1; //÷åòíîå   }      int main()   {       long long n,k,i,count,j,t;       bool yes,flag;    cin>>t;    while(t--)    {     cin>>n;     count=0;          count=0;          for(i=1+n;!count;i++)     {      if(issimple(i))      {       for(j=i+n;;j++)       {        if(issimple(j))        {         count=(i)*(j);         break;        }       }             }     }          cout<<count<<endl;     //answer(yes);    }              return 0;   }         