#include<bits/stdc++.h>
using namespace std;
int fib(int n,int f[])
{
if(f[n]!= -1) return f[n];
if( n <= 1)// 0,1asle aikne dokbe
{
f[n]=n;
return f[n];
}
f[n] = fib(n-1,f)+fib(n-2,f);
return f[n];
}
int main()
{
int n;
cin >> n;
int f[n+1];
memset(f,-1,sizeof(f));
int ans = fib(n,f);
cout << ans << endl;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBmaWIoaW50IG4saW50IGZbXSkKewogICAgaWYoZltuXSE9IC0xKSByZXR1cm4gZltuXTsKICAgIGlmKCBuIDw9IDEpLy8gMCwxYXNsZSBhaWtuZSBkb2tiZQogICAgewogICAgICAgIGZbbl09bjsKICAgICAgICByZXR1cm4gZltuXTsKICAgIH0KICAgIGZbbl0gPSBmaWIobi0xLGYpK2ZpYihuLTIsZik7CiAgICByZXR1cm4gZltuXTsKfQoKaW50IG1haW4oKQp7CgogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIGludCBmW24rMV07CiAgICBtZW1zZXQoZiwtMSxzaXplb2YoZikpOwoKICAgIGludCBhbnMgPSBmaWIobixmKTsKCiAgICBjb3V0IDw8IGFucyA8PCBlbmRsOwoKICAgIHJldHVybiAwOwp9Cg==