n = int(input())
dp = [0]*(n+1)
def fibo(n):
  if n <2:
    return 1
  if dp[n]  > 0:
    return dp[n]
  dp[n] = fibo(n-1) + fibo(n -2)
  return dp[n]
print(fibo(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 fibo(n):
  if n <2:
    return 1
  if dp[n]  > 0:
    return dp[n]
  dp[n] = fibo(n-1) + fibo(n -2)
  return dp[n] fibo if n <2:
    return 1
   n <2 n 2 return 1 1 if dp[n]  > 0:
    return dp[n]
   dp[n]  > 0 dp[n] dp n 0 return dp[n] dp[n] dp n dp[n] = fibo(n-1) + fibo(n -2) dp[n] dp n fibo(n-1) + fibo(n -2) fibo(n-1) fibo n-1 n 1 fibo(n -2) fibo n -2 n 2 return dp[n] dp[n] dp n n n print(fibo(n)) print fibo(n) fibo n def fibo(n):
  if n <2:
    return 1
  if dp[n]  > 0:
    return dp[n]
  dp[n] = fibo(n-1) + fibo(n -2)
  return dp[n] def fibo(n):
  if n <2:
    return 1
  if dp[n]  > 0:
    return dp[n]
  dp[n] = fibo(n-1) + fibo(n -2)
  return dp[n] fibo dp = [0]*(n+1) [0]*(n+1) dp n = int(input()) int(input()) n
n = int(input())
dp = [0]*(n+1)
def fibo(n):
  if n <2:
    return 1
  if dp[n]  > 0:
    return dp[n]
  dp[n] = fibo(n-1) + fibo(n -2)
  return dp[n]
print(fibo(n))
