n = int(input())

num = [-1] * 100


def fibonacci(n):
    if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

    if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

    return num[n]


print(fibonacci(n))
 n = int(input()) n int(input()) int input() input num = [-1] * 100 num [-1] * 100 [-1] -1 100 def fibonacci(n):
    if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

    if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

    return num[n] fibonacci if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

     n == 0 n 0 num[0] = 1 num[0] num 0 1 elif n == 1:
        num[1] = 1

     n == 1 n 1 num[1] = 1 num[1] num 1 1 if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

     num[n] == -1 num[n] num n -1 num[n] = fibonacci(n - 1) + fibonacci(n - 2) num[n] num n fibonacci(n - 1) + fibonacci(n - 2) fibonacci(n - 1) fibonacci n - 1 n 1 fibonacci(n - 2) fibonacci n - 2 n 2 return num[n] num[n] num n n n print(fibonacci(n)) print fibonacci(n) fibonacci n def fibonacci(n):
    if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

    if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

    return num[n] def fibonacci(n):
    if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

    if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

    return num[n] fibonacci n = int(input()) int(input()) n num = [-1] * 100 [-1] * 100 num
n = int(input())

num = [-1] * 100


def fibonacci(n):
    if n == 0:
        num[0] = 1
    elif n == 1:
        num[1] = 1

    if num[n] == -1:
        num[n] = fibonacci(n - 1) + fibonacci(n - 2)

    return num[n]


print(fibonacci(n))

