no of prime in fibbinoci

n = int(input())

def isprime(k):
    temp=0
    for i in range(1,k+1):

        if k%i == 0:
            temp += 1
            
    if temp == 2:
        return True
        
    return False

a = 0
b = 1
for i in range(n):
    c = a + b
    if isprime(b):
        print(b)
    a = b
    b = c