_fib = [0] * 45

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

n = int(input())
print(fib(n))
 _fib = [0] * 45 _fib [0] * 45 [0] 0 45 def fib(n):
    if n < 2:
        return 1
    if _fib[n] > 0:
        return _fib[n]
    _fib[n] = fib(n-1) + fib(n-2)
    return _fib[n] fib if n < 2:
        return 1
     n < 2 n 2 return 1 1 if _fib[n] > 0:
        return _fib[n]
     _fib[n] > 0 _fib[n] _fib n 0 return _fib[n] _fib[n] _fib n _fib[n] = fib(n-1) + fib(n-2) _fib[n] _fib n fib(n-1) + fib(n-2) fib(n-1) fib n-1 n 1 fib(n-2) fib n-2 n 2 return _fib[n] _fib[n] _fib n n n n = int(input()) n int(input()) int input() input print(fib(n)) print fib(n) fib n _fib = [0] * 45 [0] * 45 _fib def fib(n):
    if n < 2:
        return 1
    if _fib[n] > 0:
        return _fib[n]
    _fib[n] = fib(n-1) + fib(n-2)
    return _fib[n] def fib(n):
    if n < 2:
        return 1
    if _fib[n] > 0:
        return _fib[n]
    _fib[n] = fib(n-1) + fib(n-2)
    return _fib[n] fib n = int(input()) int(input()) n
_fib = [0] * 45

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

n = int(input())
print(fib(n))

