def prime(num):
if num<2:
return False
elif num=2:
return True
else:
for i in range(2,num):
if(num%i=0):
return False
else:
return True
def monisen(no):
List=[]
k=0
for i in range(1,pow(2,no))
if prime(i):
m=2i-1
if prime(m):
k+=1
List.append(m)
if k==no:
break
else:
continue
print(List[no-1])
monisen(int(input()))********
):