#include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;
int Fib(int n){
if(n<=1) return n;
vector<long long> dp(n+1);
dp[0]=1;dp[1]=1;
for(int i=2;i<=n;i++){
dp[i]=dp[i-1]+dp[i-2];
}
return dp[n-1];
}
signed main(){
cout << Fib(36);
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGxvbmcgbG9uZyBNT0Q9MWU5Kzc7CmludCBGaWIoaW50IG4pewogICAgaWYobjw9MSkgcmV0dXJuIG47CiAgICB2ZWN0b3I8bG9uZyBsb25nPiBkcChuKzEpOwogICAgZHBbMF09MTtkcFsxXT0xOwogICAgZm9yKGludCBpPTI7aTw9bjtpKyspewogICAgICAgIGRwW2ldPWRwW2ktMV0rZHBbaS0yXTsKICAgIH0KICAgIHJldHVybiBkcFtuLTFdOwp9CnNpZ25lZCBtYWluKCl7CiAgICBjb3V0IDw8IEZpYigzNik7Cn0KCgoKCgoKCgoKCgoKCgoKCgoKCgoKCg==