def Fibonacci(n):
    if n == 0 or n == 1:
        dic[n] = 1
    if n in dic.keys():
        return dic[n]
    dic[n] = Fibonacci(n-1) + Fibonacci(n-2)
    return dic[n]

a = int(input())
dic ={}
print(Fibonacci(a)) def Fibonacci(n):
    if n == 0 or n == 1:
        dic[n] = 1
    if n in dic.keys():
        return dic[n]
    dic[n] = Fibonacci(n-1) + Fibonacci(n-2)
    return dic[n] Fibonacci if n == 0 or n == 1:
        dic[n] = 1
     n == 0 or n == 1 n == 0 n 0 n == 1 n 1 dic[n] = 1 dic[n] dic n 1 if n in dic.keys():
        return dic[n]
     n in dic.keys() n dic.keys() dic.keys dic keys return dic[n] dic[n] dic n dic[n] = Fibonacci(n-1) + Fibonacci(n-2) dic[n] dic n Fibonacci(n-1) + Fibonacci(n-2) Fibonacci(n-1) Fibonacci n-1 n 1 Fibonacci(n-2) Fibonacci n-2 n 2 return dic[n] dic[n] dic n n n a = int(input()) a int(input()) int input() input dic ={} dic {} print(Fibonacci(a)) print Fibonacci(a) Fibonacci a def Fibonacci(n):
    if n == 0 or n == 1:
        dic[n] = 1
    if n in dic.keys():
        return dic[n]
    dic[n] = Fibonacci(n-1) + Fibonacci(n-2)
    return dic[n] def Fibonacci(n):
    if n == 0 or n == 1:
        dic[n] = 1
    if n in dic.keys():
        return dic[n]
    dic[n] = Fibonacci(n-1) + Fibonacci(n-2)
    return dic[n] Fibonacci a = int(input()) int(input()) a dic ={} {} dic
def Fibonacci(n):
    if n == 0 or n == 1:
        dic[n] = 1
    if n in dic.keys():
        return dic[n]
    dic[n] = Fibonacci(n-1) + Fibonacci(n-2)
    return dic[n]

a = int(input())
dic ={}
print(Fibonacci(a))
