def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if F[n] > 0:
        return F[n]
    F[n] = fib(n-1) + fib(n-2)
    return F[n]

n = int(input())
F = [0 for i in range(n+1)]
print(fib(n)) def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if F[n] > 0:
        return F[n]
    F[n] = fib(n-1) + fib(n-2)
    return F[n] fib if n == 0:
        return 1
     n == 0 n 0 return 1 1 if n == 1:
        return 1
     n == 1 n 1 return 1 1 if F[n] > 0:
        return F[n]
     F[n] > 0 F[n] F n 0 return F[n] F[n] F n 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 = int(input()) n int(input()) int input() input 0 for i in range(n+1) for i in range(n+1) i range(n+1) range n+1 n 1 for i in range(n+1) 0 F = [0 for i in range(n+1)] F [0 for i in range(n+1)] print(fib(n)) print fib(n) fib n def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if F[n] > 0:
        return F[n]
    F[n] = fib(n-1) + fib(n-2)
    return F[n] def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if F[n] > 0:
        return F[n]
    F[n] = fib(n-1) + fib(n-2)
    return F[n] fib F = [0 for i in range(n+1)] [0 for i in range(n+1)] F n = int(input()) int(input()) n
def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if F[n] > 0:
        return F[n]
    F[n] = fib(n-1) + fib(n-2)
    return F[n]

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