n = int(input())
def fib(n):
    m = [1,1]
    if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
    return m

if n==0:
    l = fib(n)[n]
elif n==1:
    l = fib(n)[n-1]
else:
    l = fib(n)[n]
print(l) n = int(input()) n int(input()) int input() input def fib(n):
    m = [1,1]
    if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
    return m fib m = [1,1] m [1,1] 1 1 if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
     n==0 or n==1 n==0 n 0 n==1 n 1 m=[1] m [1] 1 for k in range(2,n+1):
            m.append(m[-1]+m[-2])
     k range(2,n+1) range 2 n+1 n 1 m.append(m[-1]+m[-2]) m.append m append m[-1]+m[-2] m[-1] m -1 m[-2] m -2 return m m n n if n==0:
    l = fib(n)[n]
elif n==1:
    l = fib(n)[n-1]
else:
    l = fib(n)[n] n==0 n 0 l = fib(n)[n] l fib(n)[n] (n) fib n n elif n==1:
    l = fib(n)[n-1] n==1 n 1 l = fib(n)[n-1] l fib(n)[n-1] (n) fib n n-1 n 1 l = fib(n)[n] l fib(n)[n] (n) fib n n print(l) print l l = fib(n)[n] fib(n)[n] l l = fib(n)[n-1] fib(n)[n-1] l l = fib(n)[n] fib(n)[n] l def fib(n):
    m = [1,1]
    if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
    return m def fib(n):
    m = [1,1]
    if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
    return m fib n = int(input()) int(input()) n
n = int(input())
def fib(n):
    m = [1,1]
    if n==0 or n==1:
        m=[1]
    else:
        for k in range(2,n+1):
            m.append(m[-1]+m[-2])
    return m

if n==0:
    l = fib(n)[n]
elif n==1:
    l = fib(n)[n-1]
else:
    l = fib(n)[n]
print(l)
