def fib(n):
  if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

  return F[n]



n = input()
F = [0 for row in range(n+1)]
print fib(n) def fib(n):
  if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

  return F[n] fib if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

   F[n] != 0 F[n] F n 0 return F[n] F[n] F n elif n==0 or n==1:
    F[n] = 1
   n==0 or n==1 n==0 n 0 n==1 n 1 F[n] = 1 F[n] F n 1 F[n] = fib(n-1) + fib(n-2) F[n] F n fib(n-1) + fib(n-2) fib(n-1) fib n-1 n 1 fib(n-2) fib n-2 n 2 return F[n] F[n] F n n n n = input() n input() input 0 for row in range(n+1) for row in range(n+1) row range(n+1) range n+1 n 1 for row in range(n+1) 0 F = [0 for row in range(n+1)] F [0 for row in range(n+1)] print fib(n) fib n F = [0 for row in range(n+1)] [0 for row in range(n+1)] F def fib(n):
  if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

  return F[n] def fib(n):
  if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

  return F[n] fib n = input() input() n
def fib(n):
  if F[n] != 0:
    return F[n]
  elif n==0 or n==1:
    F[n] = 1
  else:
    F[n] = fib(n-1) + fib(n-2)

  return F[n]



n = input()
F = [0 for row in range(n+1)]
print fib(n)