n=int(input())

a=[1]*45


def fib(n):
    if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
           
print(fib(n))

 n=int(input()) n int(input()) int input() input a=[1]*45 a [1]*45 [1] 1 45 def fib(n):
    if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
            fib if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
            n==0 or n==1 n==0 n 0 n==1 n 1 return 1 1 if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
         a[n]==1 a[n] a n 1 a[n]=fib(n-1)+fib(n-2) a[n] a n fib(n-1)+fib(n-2) fib(n-1) fib n-1 n 1 fib(n-2) fib n-2 n 2 return a[n] a[n] a n n n print(fib(n)) print fib(n) fib n def fib(n):
    if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
            def fib(n):
    if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
            fib a=[1]*45 [1]*45 a n=int(input()) int(input()) n
n=int(input())

a=[1]*45


def fib(n):
    if n==0 or n==1:
        return 1
    else:
        if a[n]==1:
            a[n]=fib(n-1)+fib(n-2)
            
        return a[n]
           
print(fib(n))


