n = int(input())

F = [0]*(n+1)
if n == 0:
    print(1)
elif n==1:
    print(1)
elif n > 1:
    F[0] = 1
    F[1] = 1

    for i in range(2,n+1):
        F[i] = F[i-1] + F[i-2]

    print(F[-1]) n = int(input()) n int(input()) int input() input F = [0]*(n+1) F [0]*(n+1) [0] 0 n+1 n 1 if n == 0:
    print(1)
elif n==1:
    print(1)
elif n > 1:
    F[0] = 1
    F[1] = 1

    for i in range(2,n+1):
        F[i] = F[i-1] + F[i-2]

    print(F[-1]) n == 0 n 0 print(1) print 1 elif n==1:
    print(1) n==1 n 1 print(1) print 1 elif n > 1:
    F[0] = 1
    F[1] = 1

    for i in range(2,n+1):
        F[i] = F[i-1] + F[i-2]

    print(F[-1]) n > 1 n 1 F[0] = 1 F[0] F 0 1 F[1] = 1 F[1] F 1 1 for i in range(2,n+1):
        F[i] = F[i-1] + F[i-2]

     i range(2,n+1) range 2 n+1 n 1 F[i] = F[i-1] + F[i-2] F[i] F i F[i-1] + F[i-2] F[i-1] F i-1 i 1 F[i-2] F i-2 i 2 print(F[-1]) print F[-1] F -1 F = [0]*(n+1) [0]*(n+1) F n = int(input()) int(input()) n
n = int(input())

F = [0]*(n+1)
if n == 0:
    print(1)
elif n==1:
    print(1)
elif n > 1:
    F[0] = 1
    F[1] = 1

    for i in range(2,n+1):
        F[i] = F[i-1] + F[i-2]

    print(F[-1])
