def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n]


n = int(input())
l = [0] * (n+1)
print(fibonacci(n, l)) def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n] fibonacci if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n] n <= 1 n 1 l[n] = 1 l[n] l n 1 return l[n] l[n] l n elif l[n] != 0:
    return l[n]
   l[n] != 0 l[n] l n 0 return l[n] l[n] l n l[n] = fibonacci(n-1, l) + fibonacci(n-2, l) l[n] l n fibonacci(n-1, l) + fibonacci(n-2, l) fibonacci(n-1, l) fibonacci n-1 n 1 l fibonacci(n-2, l) fibonacci n-2 n 2 l return l[n] l[n] l n n n l l n = int(input()) n int(input()) int input() input l = [0] * (n+1) l [0] * (n+1) [0] 0 n+1 n 1 print(fibonacci(n, l)) print fibonacci(n, l) fibonacci n l l = [0] * (n+1) [0] * (n+1) l n = int(input()) int(input()) n def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n] def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n] fibonacci
def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n]


n = int(input())
l = [0] * (n+1)
print(fibonacci(n, l))
