# coding: utf-8
# Your code here!

def fibo(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if memo[n] != 0:
        return memo[n]
    memo[n]=fibo(n-1)+fibo(n-2)
    return memo[n]
n=int(input())
memo=[0 for i in range(n+1)]

print(fibo(n)) def fibo(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if memo[n] != 0:
        return memo[n]
    memo[n]=fibo(n-1)+fibo(n-2)
    return memo[n] fibo 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 memo[n] != 0:
        return memo[n]
     memo[n] != 0 memo[n] memo n 0 return memo[n] memo[n] memo n memo[n]=fibo(n-1)+fibo(n-2) memo[n] memo n fibo(n-1)+fibo(n-2) fibo(n-1) fibo n-1 n 1 fibo(n-2) fibo n-2 n 2 return memo[n] memo[n] memo 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 memo=[0 for i in range(n+1)] memo [0 for i in range(n+1)] print(fibo(n)) print fibo(n) fibo n def fibo(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if memo[n] != 0:
        return memo[n]
    memo[n]=fibo(n-1)+fibo(n-2)
    return memo[n] def fibo(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if memo[n] != 0:
        return memo[n]
    memo[n]=fibo(n-1)+fibo(n-2)
    return memo[n] fibo n=int(input()) int(input()) n memo=[0 for i in range(n+1)] [0 for i in range(n+1)] memo
# coding: utf-8
# Your code here!

def fibo(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if memo[n] != 0:
        return memo[n]
    memo[n]=fibo(n-1)+fibo(n-2)
    return memo[n]
n=int(input())
memo=[0 for i in range(n+1)]

print(fibo(n))
