N = int(input())

def memorize(f) :
    cache = {}
    def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
    return helper

@memorize
def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    res = fibonacci(n - 2) + fibonacci(n - 1)
    return res

print(fibonacci(N)) N = int(input()) N int(input()) int input() input def memorize(f) :
    cache = {}
    def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
    return helper memorize cache = {} cache {} def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
     helper if args not in cache :
            cache[args] = f(*args)
         args not in cache args cache cache[args] = f(*args) cache[args] cache args f(*args) f *args args return cache[args] cache[args] cache args *args return helper helper f f def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    res = fibonacci(n - 2) + fibonacci(n - 1)
    return res fibonacci if n == 0 or n == 1:
        return 1
     n == 0 or n == 1 n == 0 n 0 n == 1 n 1 return 1 1 res = fibonacci(n - 2) + fibonacci(n - 1) res fibonacci(n - 2) + fibonacci(n - 1) fibonacci(n - 2) fibonacci n - 2 n 2 fibonacci(n - 1) fibonacci n - 1 n 1 return res res n n @memorize fibonacci memorize fibonacci print(fibonacci(N)) print fibonacci(N) fibonacci N def memorize(f) :
    cache = {}
    def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
    return helper def memorize(f) :
    cache = {}
    def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
    return helper memorize def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    res = fibonacci(n - 2) + fibonacci(n - 1)
    return res def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    res = fibonacci(n - 2) + fibonacci(n - 1)
    return res fibonacci N = int(input()) int(input()) N
N = int(input())

def memorize(f) :
    cache = {}
    def helper(*args) :
        if args not in cache :
            cache[args] = f(*args)
        return cache[args]
    return helper

@memorize
def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    res = fibonacci(n - 2) + fibonacci(n - 1)
    return res

print(fibonacci(N))
