#include <iostream>
#include <fstream>

using namespace std;

ifstream f ( "prim.in" );
ofstream g ( "prim.out" );

const int Prime = 1300001;
int ciur[2 * Prime], x[Prime + 1], n, k, j, i;

int main()
{   f >> k;
    ciur[0] = ciur[1] = 1;
    for(i = 3; i <= Prime; i += 2){
        if(ciur[i] == 0){
            x[++n] = i;
            if ( n == k )
                break;
            for(j = 2 * i; j <= Prime; j += i)
                ciur[j] = 1;
        }
    }
    long long ans = 1ll * x[k] * x[k];
    g << ans;
    return 0;
}