n=int(input())
a=[1,1]
def fib(n):
    if n <= 1:
        return a[n]
    for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
    return a[n]
print(fib(n)) n=int(input()) n int(input()) int input() input a=[1,1] a [1,1] 1 1 def fib(n):
    if n <= 1:
        return a[n]
    for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
    return a[n] fib if n <= 1:
        return a[n]
     n <= 1 n 1 return a[n] a[n] a n for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
     i range(2,n+1) range 2 n+1 n 1 a.append(a[i-1]+a[i-2]) a.append a append a[i-1]+a[i-2] a[i-1] a i-1 i 1 a[i-2] a i-2 i 2 return a[n] a[n] a n n n print(fib(n)) print fib(n) fib n def fib(n):
    if n <= 1:
        return a[n]
    for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
    return a[n] def fib(n):
    if n <= 1:
        return a[n]
    for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
    return a[n] fib a=[1,1] [1,1] a n=int(input()) int(input()) n
n=int(input())
a=[1,1]
def fib(n):
    if n <= 1:
        return a[n]
    for i in range(2,n+1):
        a.append(a[i-1]+a[i-2])
    return a[n]
print(fib(n))
