#include <string>
#include <sstream>
#include <iostream> 
#include <cstring>
#include <algorithm>
#include <cmath> 
#include <map>
#include <queue>
#include <functional>
#include <stdio.h>
#include <set>

using namespace std;
long long a[1010]={},g[1010]={};
int f[300][100]={};
int main()
{
    int T=0,n;
    f[1][1]=1; f[2][1]=2;
    f[1][0]=1; f[2][0]=1;
    for (int i=3;i<=200;i++){
        for (int j=1;j<=f[i-1][0];j++){            
            f[i][j+1]=f[i][j+1]+(f[i][j]+f[i-1][j]+f[i-2][j])/10;
            f[i][j]=(f[i][j]+f[i-1][j]+f[i-2][j])%10;
        }
        int x=f[i-1][0];
        f[i][0]=x;
        if (f[i][x+1]>0) f[i][0]++;
    }
    while (cin >> n){
        for (int i=f[n][0];i>=1;i--) cout << f[n][i];
        cout << endl;    
    }    
}