n = int(input())

cache = {0: 1, 1: 1}
def fibonacci(n):
    if cache.get(n, None) is not None:
        return cache[n]
    cache[n] = fibonacci(n-1) + fibonacci(n-2)
    return cache[n]

print(fibonacci(n)) n = int(input()) n int(input()) int input() input cache = {0: 1, 1: 1} cache {0: 1, 1: 1} 0 0 1 1 1 1 def fibonacci(n):
    if cache.get(n, None) is not None:
        return cache[n]
    cache[n] = fibonacci(n-1) + fibonacci(n-2)
    return cache[n] fibonacci if cache.get(n, None) is not None:
        return cache[n]
     cache.get(n, None) is not None cache.get(n, None) cache.get cache get n None None return cache[n] cache[n] cache n cache[n] = fibonacci(n-1) + fibonacci(n-2) cache[n] cache n fibonacci(n-1) + fibonacci(n-2) fibonacci(n-1) fibonacci n-1 n 1 fibonacci(n-2) fibonacci n-2 n 2 return cache[n] cache[n] cache n n n print(fibonacci(n)) print fibonacci(n) fibonacci n n = int(input()) int(input()) n cache = {0: 1, 1: 1} {0: 1, 1: 1} cache def fibonacci(n):
    if cache.get(n, None) is not None:
        return cache[n]
    cache[n] = fibonacci(n-1) + fibonacci(n-2)
    return cache[n] def fibonacci(n):
    if cache.get(n, None) is not None:
        return cache[n]
    cache[n] = fibonacci(n-1) + fibonacci(n-2)
    return cache[n] fibonacci
n = int(input())

cache = {0: 1, 1: 1}
def fibonacci(n):
    if cache.get(n, None) is not None:
        return cache[n]
    cache[n] = fibonacci(n-1) + fibonacci(n-2)
    return cache[n]

print(fibonacci(n))