Go: package main

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

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()
	dp := make([]int, N+1)
	dp[0] = 1
	dp[1] = 1
	for i := 2; i <= N; i++ {
		dp[i] = dp[i-1] + dp[i-2]
	}

	fmt.Fprintln(wtr, dp[N])
	wtr.Flush()
}

C++: #include <cstdio>

int fib(int n){
	if(n == 0 || n == 1) return 1;
	return fib(n-1)+fib(n-2);
}

int main(){
	int n;
	scanf("%d", &n);
	printf("%d\n", fib(n));
	return 0;
}

C++: #include<iostream>
using namespace std;
const int MAX = 44;
int dp[MAX];
int fib(int n)
{
	if (n == 0 || n == 1)
		return dp[n] = 1;
	if (dp[n] != -1)
		return dp[n];
	return dp[n] = fib(n - 1) + fib(n - 2);
}
int main()
{
	int n;
	cin >> n;
	for (int i = 0; i <= MAX; i++)
		dp[i] = -1;
	cout << fib(n) << endl;}

C++: #include <bits/stdc++.h>

using namespace std;
const int dx[]={1,0,-1,0,1,-1,-1,1,0};
const int dy[]={0,1,0,-1,1,1,-1,-1,0};
const int INF = 1e9+101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#define rep(i,j) reps(i,0,j)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll, ll> Pll;
typedef pair<Pii,int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
template<class T>
ostream& operator<<(ostream &out, const vector<T> &v){
	out << "{";
	rep(i,v.size()){
		out << v[i] <<", ";
	}
	return out << "}" << endl;
}
int memo[50];
int solve(int l) {
    if(memo[l] != -1) return memo[l];
    if(l <= 1) return 1;
    return memo[l] = solve(l-1)+solve(l-2);
}
int main() {
    memset(memo,-1,sizeof(memo));
    int N;
    cin >> N;
    cout << solve(N) << endl;
    return 0;  
}

C++: #include <iostream>
using namespace std;

int F[100];
int main() {
  F[0] = 1;
  F[1] = 1;

  for (int i = 2; i < 45; ++i) {
    F[i] = F[i-2] + F[i-1];
  }

  int N;
  cin >> N;
  cout << F[N]<<endl;
}

C++: #include<stdio.h>
int main(){
  int A[44]={},a,i;
  A[0]=1;
  A[1]=1;
  scanf("%d",&a);
  for(i=2;i<=a;i++){
    A[i]+=(A[i-1]+A[i-2]);
  }
  printf("%d\n",A[a]);
}

C++: #include <iostream>
using namespace std;

typedef unsigned long long ull;
int dp[45] = {0};

ull fib(int n) {
  // ???????????????
  if(dp[n] != 0)return dp[n];
  if(n == 1 || n == 0)return 1;
  return dp[n] = fib(n - 2) + fib(n - 1);
}

int main(void) {
  int n;
  cin >> n;
  cout << fib(n) << endl;
  return 0;
}

C++: #include<stdio.h>

#define MAX 50

int db[MAX];

int fibonacci(int n) {
    if (n == 0 || n == 1) return 1;
    if (db[n] != -1) return db[n];
    return db[n] = fibonacci(n - 1) + fibonacci(n - 2);
}

int main() {
    int n;
    for (int i = 0; i < MAX; ++i) db[i] = -1;

    scanf("%d", &n);
    int result = fibonacci(n);
    printf("%d\n", result);
    return 0;
}

C++: #include<iostream>
using namespace std;

int Fibonacci(int n)
{
	if (n == 1 || n == 2) return 1;
	return Fibonacci(n - 1) + Fibonacci(n - 2);
}

int main()
{
	int n;
	cin >> n;
	cout << Fibonacci(n) << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

long long fib[50] = {};

void Fib(long long n) {
    if(n == 0 || n == 1) fib[n] = 1;
    else fib[n] =  fib[n -1] + fib[n - 2];
}

int main(void) {
    int n;
    scanf("%d", &n);
    
    for(int i = 0; i < 50; ++i) Fib(i);
    
    printf("%d\n", fib[n]);
    
    return 0;
}

C++: #include <iostream>
using namespace std;
typedef long long ll;

ll fibonacci(ll n) {
  if(n < 2)
    return 1;
  return fibonacci(n-1)+fibonacci(n-2);
}
int main() {
  ll n;
  cin >> n;
  cout << fibonacci(n) << endl;
}

C++: 
#include <iostream>
#include <string>
using namespace std;

int main()
{
  cout<<"Hallo World"<<endl;
}

C++: #include <iostream>
using namespace std;

int memo[45], n;

void init(){
  for(int i = 0; i <= n; i++){
    memo[i] = -1;
  }
}

int fibo(int d){
  if(memo[d] >= 0) return memo[d];
  if(d == 0 || d == 1) return memo[d] = 1;
  return memo[d] = fibo(d - 1) + fibo(d - 2);
}

int main(void){
  cin >> n;
  init();
  cout << fibo(n) << endl;;
  return 0;
}

C++: //Fibonacci Number
#include <iostream>

using namespace std;

const int NIL = -1;

int fibonacci(int n) {
    if(n == 0 || n == 1) return 1;

    int dp[n+1];
    dp[0] = 1; dp[1] = 1;
    for(int i=2; i<n+1; i++) dp[i] = dp[i-1] + dp[i-2];
    return dp[n];
}

int main() {
    int n;
    cin >> n;
    cout << fibonacci(n) << endl;
}

C++: #include <stdio.h>

int main(void) {
	int n;
	int F[45];
	scanf("%d", &n);
	F[0] = F[1] = 1;
	for (int i = 2; i <= 44; i ++) {
		F[i] = F[i-1] + F[i-2];
	}
	printf("%d\n", F[n]);
	return 0;
}

C++: 
#include<iostream>
#include<cstdio>

using namespace std;

int n,dp[50];

int fib(int n)
{
    if(n==0||n==1){
        return dp[n]=1;
    }
    if(dp[n]!=-1){
        return dp[n];
    }
    return dp[n]=fib(n-1)+fib(n-2);
}

int main()
{
    for(int i=0;i<50;i++){
        dp[i]=-1;
    }
    scanf("%d",&n);
    printf("%d\n",fib(n));
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define debug(x) cout << #x << "==" << x << endl;

using namespace std;

//??\???
#define MAX_N 44
int N;
int dp[MAX_N];

int main() {
  ios::sync_with_stdio(false);

  cin >> N;

  // dp[0] = dp[1] = 1;
  // for(int i = 2; i <= N; i++) {
  //   dp[i] = dp[i-1] + dp[i-2];
  // }

  int now = 0;
  int prev1 = 1, prev2 = 1;
  for(int i = 2; i <= N; i++) {
    now = prev1 + prev2;
    prev2 = prev1;
    prev1 = now;
  }

  cout << now << endl;

  return 0;
}