memo={}
def fib(n) :
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2]
n = int(input())
print(fib(n)) memo={} memo {} def fib(n) :
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2] fib if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2] n == 0 n 0 return 1 1 elif n == 1 :
        return 1
     n == 1 n 1 return 1 1 if n-1 not in memo:
            memo[n-1] = fib(n-1)
         n-1 not in memo n-1 n 1 memo memo[n-1] = fib(n-1) memo[n-1] memo n-1 n 1 fib(n-1) fib n-1 n 1 if n-2 not in memo:
            memo[n-2] = fib(n-2)
         n-2 not in memo n-2 n 2 memo memo[n-2] = fib(n-2) memo[n-2] memo n-2 n 2 fib(n-2) fib n-2 n 2 return memo[n-1] + memo[n-2] memo[n-1] + memo[n-2] memo[n-1] memo n-1 n 1 memo[n-2] memo n-2 n 2 n n n = int(input()) n int(input()) int input() input print(fib(n)) print fib(n) fib n n = int(input()) int(input()) n memo={} {} memo def fib(n) :
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2] def fib(n) :
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2] fib
memo={}
def fib(n) :
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    else :
        if n-1 not in memo:
            memo[n-1] = fib(n-1)
        if n-2 not in memo:
            memo[n-2] = fib(n-2)
        return memo[n-1] + memo[n-2]
n = int(input())
print(fib(n))
