Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	fmt.Println(resolve(parseProblem()))
}

func parseProblem() int {
	return scanInt(sc)
}

func resolve(n int) int {
	dp := make([]int, n+1)
	dp[0], dp[1] = 1, 1
	for i := 2; i <= n; i++ {
		dp[i] = dp[i-1] + dp[i-2]
	}
	return dp[n]
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

Python: n=int(input())
if n==0 or n==1:
    print(1)
else:
    a=[]
    a.append(1)
    a.append(1)
    for i in range(2,n+1):
        m=a[i-2]+a[i-1]
        a.append(m)
    print(m)

Python: 
n = int(input())
dp = [None] * (n+1)
dp[0] = 1
dp[1] = 1


def main():
    print(fib(n))


def fib(n):
    if n == 0 or n == 1:
        return 1
    elif dp[n] != None:
        return dp[n]
    else:
        dp[n] = fib(n-1) + fib(n-2)
        return dp[n]


if __name__ == "__main__":
    main()

Python: dp=[0]*50
dp[0]=1
dp[1]=1
N = int(input())

def makefib(n):
    if n == 0 or n == 1:
        return 1
    elif dp[n] == 0:
        dp[n] = makefib(n-1) + makefib(n-2)
        return dp[n]
    else:
        return dp[n]
print(makefib(N))

Python: x=int(input())
a=1
b=1
i=1
if x==0:
    print(1)
elif x==1:
    print(1)

else:
    while i<=x-1:
        c=a+b
        a=b
        b=c
        i+=1
    print(c)

Python: # coding: utf-8
# Your code here!

def fibo(n, memo = {}):
   if n == 0 or n == 1:
      return 1
   elif n in memo:
      return memo[n]
   else:
      memo[n] = fibo(n - 1, memo) + fibo(n - 2, memo)
      return memo[n]

n = int(input())
print(fibo(n))

Python: n = int(input())

dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1

for i in range(2, n + 1):
    dp[i] = dp[i - 1] + dp[i - 2]

ans = dp[n]
print(ans)

Python: n=int(input())
f=[0]*(n+1)
def fib(n,f):
	if n==0 or n==1:
		return 1
	else:
		if f[n]!=0:
			return f[n]
		else:
			f[n]=fib(n-1,f)+fib(n-2,f)
			return f[n]
print(fib(n,f))

Python: # -*- coding: utf-8 -*-

fib = [-1 for _ in range(50)]
fib[0] = 1
fib[1] = 2

for n in range(2, 50):
    fib[n] = fib[n - 1] + fib[n - 2]

N = int(input())
print(fib[N - 1])

Python: def makeFibonacci(n):
    F = [0] * (n+1)
    if n == 0:
        F[0] = 1
    else:
        F[0] = 1
        F[1] = 1
        for i in range(2, n+1):
            F[i] = F[i-2]+F[i-1]
    return F

n = int(input())
Ans = makeFibonacci(n)
print(Ans[n])

Python: n = int(input())
fib_b = [1,1]
if n > 1:
    for i in range(2,n+1):
        fib_b.append(fib_b[i-1]+fib_b[i-2])

print(fib_b[n])

Python: def fib(n):
    return 1 if n == 0 or n == 1 else fib(n - 1) + fib(n - 2)

print(fib(int(input())))

Python: n = int(input().strip())
if n == 0:
    print(1)
elif n == 1:
    print(1)
else:
    lst = [0 for i in range(0,n+1)]
    lst[0] = 1
    lst[1] = 1
    for i in range(0,n-1):
        lst[i+2] = lst[i+1] + lst[i]
    print(lst[n])

Python: n = int(input())
fib = [1, 1]
for i in range(2, n+1):
  fib.append(fib[i-1] + fib[i-2])
print(fib.pop())

Python: a=1
b=1
c=[]

n=int(input())
c.append(a)
c.append(b)
for i in range(n):
    c.append(a+b)
    d=b
    b+=a
    a=d
print(c[n])

Python: n = int(input())

dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1

for i in range(2, n + 1):
    dp[i] = dp[i - 1] + dp[i - 2]

print(dp[n])

Python: def makeFibonacci(n):
    if n <= 1:
        return str(1)
    F = [None]*(n+1)
    F[0] = 1
    F[1] = 1
    for i in range(2, n+1):
        F[i] = F[i-1] + F[i - 2]
    return str(F[n])

n = int(input())
print(makeFibonacci(n))

Python: n = int(input())
fib = [1]*(n+1)
for i in range(2,n+1): fib[i] = fib[i-1] + fib[i-2]
print(fib[n])

Python: n=int(input())
def Fib(n):
    a,b=0,1
    for i in range(n):
        a,b=b,a+b
    return b
print(Fib(n))

Python: #coding:UTF-8
def FN(n):
    if n==0 or n==1:
        return 1
    else:
        ans=FN(n-1)+FN(n-2)
        return ans
if __name__=="__main__":
    n=int(input())
    ans=FN(n)
    print(ans)

Python: F = {}

def fib(n):
  global F
  if n < 0:
    print("error")
    exit()
  if n < 2:
    F[n] = 1
    return F[n]
#  F[n] = fib(n-1) + fib(n-2)
  F[n] = F(n-1) + F(n-2)
  return F[n]

n = int(input())
print(fib(n))
#n = int(input())
#print(fib(n))
#fib(44)
#for i in range(5+1):
#  print(F[i])

Python: # Fibonacci Number

N = int(input())
dp = [-1] * (N+1)
dp[0] = 1
dp[1] = 1
for i in range(2, N+1):
    dp[i] = dp[i-2] + dp[i-1]
print(dp[-1])

Python: def fib(n):
    if n == 0 or n == 1:
        return 1
    else :
        return fib(n - 1) + fib(n - 2)


print( fib( int( input() ) ) )

Python: n = int(input())
fib = [0] * (n+1)
fib[0] = 1
fib[1] = 1
for i in range(2, n+1):
  fib[i] = fib[i-1] + fib[i-2]
print(fib[n])

Python: n=int(input())
dp=[0]*(n+1)
dp[0],dp[1]=1,1
for i in range(2,n+1):
    dp[i]=dp[i-1]+dp[i-2]
print(dp[n])

Python: n = int(input())
fib_ls = [0] * (n+1)
fib_ls[0], fib_ls[1] = 1,1
for i in range(2,n+1):
    fib_ls[i] = fib_ls[i-1] + fib_ls[i-2]
print(fib_ls[n])

Python: A = {}
def fibonacci(n):
    global A
    if n == 0 or n == 1:
        A[n] = 1
        return A[n]
    if n in A:
        return A[n]
    else:
        A[n] = fibonacci(n - 2) + fibonacci(n - 1)
        return A[n]

n = int(input())
print(fibonacci(n))

Python: def fib(n):
    if n == 0 or n == 1:
        return 1
    return fib(n-1) + fib(n-2)

n = int(input())
print(fib(n))

Python: N = int(input())

DP = [0 for _ in range(N + 1)]
DP[0] = 1
DP[1] = 1

for i in range(2, N + 1):
    DP[i] = DP[i - 1] + DP[i - 2]

print(DP[N])

Python: n = int(input())

from functools import lru_cache
@lru_cache(maxsize=None)
def fibo(n: int):
    if n == 0 or n == 1:
        return 1
    return fibo(n-1) + fibo(n-2)

print(fibo(n))

Python: def fib(a, b, fiboli):
    if len(fiboli) < n:
        fiboli.append(fiboli[-1] + fiboli[-2])
        fib(fiboli[-1], fiboli[-1] + fiboli[-2], fiboli)
    else:
        print(fiboli[-1])
        print(fiboli)

# n = 4
n = int(input())
if n == 0 or n == 1:
    print(1)
elif n == 2:
    print(2)
else:
    fibo_list = []
    fibo_list.append(n - 1)
    fibo_list.append(n - 2)
    fib(n - 1, n - 2, fibo_list)

Python: f=[None for i in range(45)]

def fib(n):
    if n==0 or n==1:
        if f[n] is None:
            f[n] = 1
        return 1
    else:
        if f[n-2] is not None:
            f_n_2 = f[n-2]
        else:
            f_n_2 = fib(n-2)
            f[n-2] = f_n_2
        if f[n-1] is not None:
            f_n_1 =  f[n-1]
        else:
            f_n_1 = fib(n-1)
            f[n-1] = f_n_1
        f[n] = f_n_1 + f_n_2
        return f[n]
n = int(input())
print(fib(n))

Python: def main():
    n = int(input())
    fib = [1] * (n + 1)
    for i in range(2, n + 1):
        fib[i] = fib[i - 1] + fib[i - 2]
    print(fib[n])


if __name__ == "__main__":
    main()

Python: MAX_N = 44
_memo = [None for _ in range(MAX_N + 1)]
_memo [0] = _memo[1] = 1

def fibonacci(n):
    
    if _memo[n] is not None:
        return _memo[n]
    else:
        _memo[n] = fibonacci(n - 1) + fibonacci(n - 2)
        return _memo[n]

if __name__ == '__main__':
    n = int(input())
    print(fibonacci(n))

Python: def fibn(n):
    fib = [1,1]
    for i in range(2,n+1):
        fib.append(fib[i-2] + fib[i-1])
    return fib[n]
    
n = int(input())
print(fibn(n))

Python: from functools import lru_cache
n = int(input())

@lru_cache(maxsize=None)


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