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

def fib(n):
    if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans

print(fib(n)) n = int(input()) n int(input()) int input() input memo = [-1]*(n+1) memo [-1]*(n+1) [-1] -1 n+1 n 1 memo[0] = 1 memo[0] memo 0 1 memo[1] = 1 memo[1] memo 1 1 def fib(n):
    if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans fib if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans memo[n] != -1 memo[n] memo n -1 return memo[n] memo[n] memo n ans = fib(n-1)+fib(n-2) ans fib(n-1)+fib(n-2) fib(n-1) fib n-1 n 1 fib(n-2) fib n-2 n 2 memo[n] = ans memo[n] memo n ans return ans ans n n print(fib(n)) print fib(n) fib n n = int(input()) int(input()) n memo = [-1]*(n+1) [-1]*(n+1) memo def fib(n):
    if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans def fib(n):
    if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans fib
n = int(input())
memo = [-1]*(n+1)
memo[0] = 1
memo[1] = 1

def fib(n):
    if memo[n] != -1:
        return memo[n]
    else:
        ans = fib(n-1)+fib(n-2)
        memo[n] = ans
        return ans

print(fib(n))
