n = int(input())
dp = [None for _ in range(n+1)]

def fib(i):
    if dp[i] is not None:
        return dp[i]
    if i==0:
        return 1
    if i==1:
        return 1
    dp[i] = fib(i-1) + fib(i-2)
    return dp[i]

print(fib(n)) n = int(input()) n int(input()) int input() input None for _ in range(n+1) for _ in range(n+1) _ range(n+1) range n+1 n 1 for _ in range(n+1) None dp = [None for _ in range(n+1)] dp [None for _ in range(n+1)] def fib(i):
    if dp[i] is not None:
        return dp[i]
    if i==0:
        return 1
    if i==1:
        return 1
    dp[i] = fib(i-1) + fib(i-2)
    return dp[i] fib if dp[i] is not None:
        return dp[i]
     dp[i] is not None dp[i] dp i None return dp[i] dp[i] dp i if i==0:
        return 1
     i==0 i 0 return 1 1 if i==1:
        return 1
     i==1 i 1 return 1 1 dp[i] = fib(i-1) + fib(i-2) dp[i] dp i fib(i-1) + fib(i-2) fib(i-1) fib i-1 i 1 fib(i-2) fib i-2 i 2 return dp[i] dp[i] dp i i i print(fib(n)) print fib(n) fib n def fib(i):
    if dp[i] is not None:
        return dp[i]
    if i==0:
        return 1
    if i==1:
        return 1
    dp[i] = fib(i-1) + fib(i-2)
    return dp[i] def fib(i):
    if dp[i] is not None:
        return dp[i]
    if i==0:
        return 1
    if i==1:
        return 1
    dp[i] = fib(i-1) + fib(i-2)
    return dp[i] fib n = int(input()) int(input()) n dp = [None for _ in range(n+1)] [None for _ in range(n+1)] dp
n = int(input())
dp = [None for _ in range(n+1)]

def fib(i):
    if dp[i] is not None:
        return dp[i]
    if i==0:
        return 1
    if i==1:
        return 1
    dp[i] = fib(i-1) + fib(i-2)
    return dp[i]

print(fib(n))
