N = int(input())

def solve(N):
    fib = [1]*(N+1)
    for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
    ans = fib[N]
    return ans
print(solve(N)) N = int(input()) N int(input()) int input() input def solve(N):
    fib = [1]*(N+1)
    for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
    ans = fib[N]
    return ans solve fib = [1]*(N+1) fib [1]*(N+1) [1] 1 N+1 N 1 for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
     i range(2,N+1) range 2 N+1 N 1 fib[i] = fib[i-1] + fib[i-2] fib[i] fib i fib[i-1] + fib[i-2] fib[i-1] fib i-1 i 1 fib[i-2] fib i-2 i 2 ans = fib[N] ans fib[N] fib N return ans ans N N print(solve(N)) print solve(N) solve N def solve(N):
    fib = [1]*(N+1)
    for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
    ans = fib[N]
    return ans def solve(N):
    fib = [1]*(N+1)
    for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
    ans = fib[N]
    return ans solve N = int(input()) int(input()) N
N = int(input())

def solve(N):
    fib = [1]*(N+1)
    for i in range(2,N+1):
        fib[i] = fib[i-1] + fib[i-2]
    ans = fib[N]
    return ans
print(solve(N))
