#include <bits/stdc++.h>
using namespace std;
ifstream in ("prim.in");
ofstream out ("prim.out");
bool ciur[2000002];
int cnt=0;
int main()
{
    long long n,x=0;
    in>>n;
    for (int i=2; i<=2000000; ++i)
        if (!ciur[i])
        {
            ++cnt;
            if(cnt == n + 1)
            {
                x = i;
                break;
            }
            for (int j=2*i; j<=2000000; j+=i)
                ciur[j]=1;
        }
    out<<x*x;
    return 0;
}