import math
def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if (n%i):
            return False

    return True

with open("prim.in","r") as f:
    nr = int(f.readline())

count = 1
n = 2

while(count <= nr+1):
    if prime(n):
        count+=1
    n+=1

with open("prim.out", "w") as g:
    g.write(str((n)*(n)))