n=int(input())
MAX_N=n
X = [None] * (MAX_N + 1)
def f(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if X[n]:
        return X[n]
    r=f(n-1)+f(n-2)
    X[n]=r
    return r
print(f(n)) n=int(input()) n int(input()) int input() input MAX_N=n MAX_N n X = [None] * (MAX_N + 1) X [None] * (MAX_N + 1) [None] None MAX_N + 1 MAX_N 1 def f(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if X[n]:
        return X[n]
    r=f(n-1)+f(n-2)
    X[n]=r
    return r f 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 X[n]:
        return X[n]
     X[n] X n return X[n] X[n] X n r=f(n-1)+f(n-2) r f(n-1)+f(n-2) f(n-1) f n-1 n 1 f(n-2) f n-2 n 2 X[n]=r X[n] X n r return r r n n print(f(n)) print f(n) f n X = [None] * (MAX_N + 1) [None] * (MAX_N + 1) X n=int(input()) int(input()) n MAX_N=n n MAX_N def f(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if X[n]:
        return X[n]
    r=f(n-1)+f(n-2)
    X[n]=r
    return r def f(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if X[n]:
        return X[n]
    r=f(n-1)+f(n-2)
    X[n]=r
    return r f
n=int(input())
MAX_N=n
X = [None] * (MAX_N + 1)
def f(n):
    if n==0:
        return 1
    if n==1:
        return 1
    if X[n]:
        return X[n]
    r=f(n-1)+f(n-2)
    X[n]=r
    return r
print(f(n))
