num = int(input())

dp = { 0: 1, 1: 1 }
def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n]

print(fibonacci(num))
 num = int(input()) num int(input()) int input() input dp = { 0: 1, 1: 1 } dp { 0: 1, 1: 1 } 0 0 1 1 1 1 def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n] fibonacci if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
   not n in dp n in dp n dp dp[n] = fibonacci(n - 1) + fibonacci(n - 2) dp[n] dp n fibonacci(n - 1) + fibonacci(n - 2) fibonacci(n - 1) fibonacci n - 1 n 1 fibonacci(n - 2) fibonacci n - 2 n 2 return dp[n] dp[n] dp n n n print(fibonacci(num)) print fibonacci(num) fibonacci num def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n] def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n] fibonacci num = int(input()) int(input()) num dp = { 0: 1, 1: 1 } { 0: 1, 1: 1 } dp
num = int(input())

dp = { 0: 1, 1: 1 }
def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n]

print(fibonacci(num))

