N=int(input())
DP=[0]*(N+1)
def fin(n):
    if DP[n]!=0:
        return DP[n]
    if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n]
print(fin(N)) N=int(input()) N int(input()) int input() input DP=[0]*(N+1) DP [0]*(N+1) [0] 0 N+1 N 1 def fin(n):
    if DP[n]!=0:
        return DP[n]
    if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n] fin if DP[n]!=0:
        return DP[n]
     DP[n]!=0 DP[n] DP n 0 return DP[n] DP[n] DP n if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n] n<=1 n 1 DP[n]=1 DP[n] DP n 1 return DP[n] DP[n] DP n DP[n]=fin(n-1)+fin(n-2) DP[n] DP n fin(n-1)+fin(n-2) fin(n-1) fin n-1 n 1 fin(n-2) fin n-2 n 2 return DP[n] DP[n] DP n n n print(fin(N)) print fin(N) fin N N=int(input()) int(input()) N DP=[0]*(N+1) [0]*(N+1) DP def fin(n):
    if DP[n]!=0:
        return DP[n]
    if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n] def fin(n):
    if DP[n]!=0:
        return DP[n]
    if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n] fin
N=int(input())
DP=[0]*(N+1)
def fin(n):
    if DP[n]!=0:
        return DP[n]
    if n<=1:
        DP[n]=1
        return DP[n]
    else:
        DP[n]=fin(n-1)+fin(n-2)
        return DP[n]
print(fin(N))
