f = [1]*31
def fib(n):
    if not (f[n] > 1 or n < 2):
        f[n] = fib(n-1) + fib(n-2)
    return f[n]
fib(30)
print(f[int(input())])