n = int(input())
L = [-1]*(n+1)
def fib(i,L):
    if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L)
print(fib(n,L)) n = int(input()) n int(input()) int input() input L = [-1]*(n+1) L [-1]*(n+1) [-1] -1 n+1 n 1 def fib(i,L):
    if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L) fib if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L) i <= 1 i 1 return 1 1 if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
         L[i] != -1 L[i] L i -1 return L[i] L[i] L i L[i] = fib(i-1,L)+fib(i-2,L) L[i] L i fib(i-1,L)+fib(i-2,L) fib(i-1,L) fib i-1 i 1 L fib(i-2,L) fib i-2 i 2 L return L[i] L[i] L i return fib(i-1,L)+fib(i-2,L) fib(i-1,L)+fib(i-2,L) fib(i-1,L) fib i-1 i 1 L fib(i-2,L) fib i-2 i 2 L i i L L print(fib(n,L)) print fib(n,L) fib n L def fib(i,L):
    if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L) def fib(i,L):
    if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L) fib L = [-1]*(n+1) [-1]*(n+1) L n = int(input()) int(input()) n
n = int(input())
L = [-1]*(n+1)
def fib(i,L):
    if i <= 1:
        return 1
    else:
        if L[i] != -1:
            return L[i]
        else:
            L[i] = fib(i-1,L)+fib(i-2,L)
            return L[i]
        return fib(i-1,L)+fib(i-2,L)
print(fib(n,L))
