import math

def is_prime(n):
    if n <= 1:
        return False
    if n == 2:
        print(n)
        return True
    if n > 2 and n % 2 == 0:
        return False
 
    divide = int(math.floor(math.sqrt(n)))
    for i in range(3, 1 + divide, 2):
        if n % i == 0:
            return False
    print(n)
    return True
 
count = 0
num = int(input())
for n in range(1,1000):
    x = is_prime(n)
    count += x
    if count > num - 1:
        break