n = int(input())

# 動的計画法
def fibonacci(n):
    F = [0]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-2] + F[i-1]
    return F

f = fibonacci(n)
print(f[n]) n = int(input()) n int(input()) int input() input def fibonacci(n):
    F = [0]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-2] + F[i-1]
    return F fibonacci F = [0]*(n+1) F [0]*(n+1) [0] 0 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-2] + F[i-1]
     i range(2, n+1) range 2 n+1 n 1 F[i] = F[i-2] + F[i-1] F[i] F i F[i-2] + F[i-1] F[i-2] F i-2 i 2 F[i-1] F i-1 i 1 return F F n n f = fibonacci(n) f fibonacci(n) fibonacci n print(f[n]) print f[n] f n def fibonacci(n):
    F = [0]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-2] + F[i-1]
    return F def fibonacci(n):
    F = [0]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-2] + F[i-1]
    return F fibonacci n = int(input()) int(input()) n f = fibonacci(n) fibonacci(n) f
n = int(input())

# 動的計画法
def fibonacci(n):
    F = [0]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-2] + F[i-1]
    return F

f = fibonacci(n)
print(f[n])
