from math import sqrt
from collections import Counter

def prime_factorization(n):
    counter = Counter()
    for i in range(2, int(sqrt(n)) + 1):
        while n % i == 0:
            n //= i
            counter[i] += 1

    if n != 1:
        counter[n] += 1

    return list(counter.items())

def prime_factors(n):
    return set(map(lambda x: x[0], prime_factorization(n)))



"""
non = set()
for to_f in range(2, 10**5+1):
   print(to_f, prime_factors(to_f)) 
   non |= prime_factors(to_f)


ans = []
cur = 10**5+1
while True:
    now = prime_factors(cur)
    if len(now & non) == 0:
        ans.append(cur)

    cur += 1
    if len(ans) == 10:
        break

print("***")
for a in ans:
    print(a)

"""

res = """1
100003
100019
100043
100049
100057
100069
100103
100109
100129
100151""".split("\n")

i = int(input())
print(res[i-1])