//Infoarea. Arhiva De Probleme. Numere Prime.
#include<iostream>
#include<fstream>
using namespace std;

bool ciur[2000005];

int main(){
    freopen("prim.in","r",stdin);
    freopen("prim.out","w",stdout);
    int k,M=2000005;
    cin>>k;

    ciur[1]=1;
    for(int i=2;i<=M;i++){
        if(ciur[i]==0){
            for(int j=i+i;j<=M;j+=i) ciur[j]=1;
        }
    }

    long long aux=0,i;
    for(i=1;i<=M && aux<k+1;i++){
        if(ciur[i]==0) aux++;
    }
    i--;
    cout<<i*i;

}