memo = [1, 1]

def fib(n):
    if (n < len(memo)):
        return memo[n]

    memo.append(fib(n-1) + fib(n-2))
    return memo[n]

N = int(input())
print(fib(N)) memo = [1, 1] memo [1, 1] 1 1 def fib(n):
    if (n < len(memo)):
        return memo[n]

    memo.append(fib(n-1) + fib(n-2))
    return memo[n] fib if (n < len(memo)):
        return memo[n]

     n < len(memo) n len(memo) len memo return memo[n] memo[n] memo n memo.append(fib(n-1) + fib(n-2)) memo.append memo append fib(n-1) + fib(n-2) fib(n-1) fib n-1 n 1 fib(n-2) fib n-2 n 2 return memo[n] memo[n] memo n n n N = int(input()) N int(input()) int input() input print(fib(N)) print fib(N) fib N N = int(input()) int(input()) N memo = [1, 1] [1, 1] memo def fib(n):
    if (n < len(memo)):
        return memo[n]

    memo.append(fib(n-1) + fib(n-2))
    return memo[n] def fib(n):
    if (n < len(memo)):
        return memo[n]

    memo.append(fib(n-1) + fib(n-2))
    return memo[n] fib
memo = [1, 1]

def fib(n):
    if (n < len(memo)):
        return memo[n]

    memo.append(fib(n-1) + fib(n-2))
    return memo[n]

N = int(input())
print(fib(N))
