N = int(input())
dp = [None] * (N + 1)

def fib(n):
    if dp[n] != None:
        return dp[n]
    if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
    return dp[n]

print(fib(N)) N = int(input()) N int(input()) int input() input dp = [None] * (N + 1) dp [None] * (N + 1) [None] None N + 1 N 1 def fib(n):
    if dp[n] != None:
        return dp[n]
    if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
    return dp[n] fib if dp[n] != None:
        return dp[n]
     dp[n] != None dp[n] dp n None return dp[n] dp[n] dp n if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
     n == 0 or n == 1 n == 0 n 0 n == 1 n 1 dp[n] = 1 dp[n] dp n 1 dp[n] = fib(n - 2) + fib(n - 1) dp[n] dp n fib(n - 2) + fib(n - 1) fib(n - 2) fib n - 2 n 2 fib(n - 1) fib n - 1 n 1 return dp[n] dp[n] dp n n n print(fib(N)) print fib(N) fib N def fib(n):
    if dp[n] != None:
        return dp[n]
    if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
    return dp[n] def fib(n):
    if dp[n] != None:
        return dp[n]
    if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
    return dp[n] fib N = int(input()) int(input()) N dp = [None] * (N + 1) [None] * (N + 1) dp
N = int(input())
dp = [None] * (N + 1)

def fib(n):
    if dp[n] != None:
        return dp[n]
    if n == 0 or n == 1:
        dp[n] = 1
    else:
        dp[n] = fib(n - 2) + fib(n - 1)
    return dp[n]

print(fib(N))
