####
n = int(input())
memo = [-1]*(n+10)
def fib(i):
    if i==0 or i == 1:
        return 1
    if memo[i] != -1:
        return memo[i]
    memo[i] = fib(i-1) + fib(i-2)
    return memo[i]
print(fib(n)) n = int(input()) n int(input()) int input() input memo = [-1]*(n+10) memo [-1]*(n+10) [-1] -1 n+10 n 10 def fib(i):
    if i==0 or i == 1:
        return 1
    if memo[i] != -1:
        return memo[i]
    memo[i] = fib(i-1) + fib(i-2)
    return memo[i] fib if i==0 or i == 1:
        return 1
     i==0 or i == 1 i==0 i 0 i == 1 i 1 return 1 1 if memo[i] != -1:
        return memo[i]
     memo[i] != -1 memo[i] memo i -1 return memo[i] memo[i] memo i memo[i] = fib(i-1) + fib(i-2) memo[i] memo i fib(i-1) + fib(i-2) fib(i-1) fib i-1 i 1 fib(i-2) fib i-2 i 2 return memo[i] memo[i] memo i i i print(fib(n)) print fib(n) fib n n = int(input()) int(input()) n memo = [-1]*(n+10) [-1]*(n+10) memo def fib(i):
    if i==0 or i == 1:
        return 1
    if memo[i] != -1:
        return memo[i]
    memo[i] = fib(i-1) + fib(i-2)
    return memo[i] def fib(i):
    if i==0 or i == 1:
        return 1
    if memo[i] != -1:
        return memo[i]
    memo[i] = fib(i-1) + fib(i-2)
    return memo[i] fib
####
n = int(input())
memo = [-1]*(n+10)
def fib(i):
    if i==0 or i == 1:
        return 1
    if memo[i] != -1:
        return memo[i]
    memo[i] = fib(i-1) + fib(i-2)
    return memo[i]
print(fib(n))
