n = int(input())
memo = [None]*(n+1)

def Fib(n):
    if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r
print(Fib(n)) n = int(input()) n int(input()) int input() input memo = [None]*(n+1) memo [None]*(n+1) [None] None n+1 n 1 def Fib(n):
    if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r Fib if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r n==0 or n==1 n==0 n 0 n==1 n 1 return 1 1 elif memo[n]:
        return memo[n]
     memo[n] memo n return memo[n] memo[n] memo n r=Fib(n-1)+Fib(n-2) r Fib(n-1)+Fib(n-2) Fib(n-1) Fib n-1 n 1 Fib(n-2) Fib n-2 n 2 memo[n]=r memo[n] memo n r return r r n n print(Fib(n)) print Fib(n) Fib n def Fib(n):
    if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r def Fib(n):
    if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r Fib memo = [None]*(n+1) [None]*(n+1) memo n = int(input()) int(input()) n
n = int(input())
memo = [None]*(n+1)

def Fib(n):
    if n==0 or n==1:
        return 1
    elif memo[n]:
        return memo[n]
    else:
        r=Fib(n-1)+Fib(n-2)
        memo[n]=r
        return r
print(Fib(n))
