//网上只有用Java做的,我做一个c++的,进位的时候出了点意外,后来改过来了。
//题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1512
#include<iostream>
using namespace std;
int a[100][2][50];
int b[100][50];
int main()
{
int i, m, j, k, n;
for (i = 0; i < 100; i++)
{
for (j = 0; j < 50; j++)
{
b[i][j] = 0;
for (k = 1; k < 2; k++)
{
a[i][k][j] = 0;
}
}
}
a[0][1][0] = 1;
for (i = 1; i < 100; i++)
{
for (j = 0; j < 50; j++)
{
a[i][0][j] += a[i - 1][0][j] + a[i - 1][1][j];
a[i][1][j] += a[i - 1][0][j] + a[i - 1][1][j] + a[i - 1][1][j];
if (a[i][0][j] >= 10)
{
n = a[i][0][j] / 10;
a[i][0][j] %= 10;
a[i][0][j + 1] += n;
}
if (a[i][1][j] >= 10)
{
n = a[i][1][j] / 10;
a[i][1][j] %= 10;
a[i][1][j + 1] += n;
}
}
}
for (i = 0; i < 100; i++)
{
for (j = 0; j < 49; j++)
{
b[i][j] += a[i][0][j] + a[i][1][j];
if (b[i][j] >= 10)
{
b[i][j] %= 10;
b[i][j+1]++;
}
}
}
while (cin >> m)
{
int flag = 0;
for (i = 49; i >= 0; i--)
{
if (b[m - 1][i] != 0) flag = 1;
if (flag == 1)cout << b[m-1][i];
}
cout << endl;
}
return 0;
}