#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <math.h>
#include<iostream>
#include <map>
using namespace std;
#define INF 0xfffff;//0x代表十六进制
#define M 150
int c1[M];
int c2[M];
int main()
{
int n;
while (cin >> n)
{
for (int i = 0; i <= n; i++)
{
c1[i] = 1;
c2[i] = 0;
}
/*整个过程都是用第一个多项式和其他的乘*/
for (int i = 2; i <= n; i++) //跟第i个多项式匹配
{
for (int j = 0; j <= n; j++)
for (int k = 0; k + j <= n; k += i) c2[k + j] += c1[j]; //<=n是n之后的不用考虑,k+=i不理解
for (int j = 0; j <= n; j++)
{
c1[j] = c2[j];
c2[j] = 0;
}
}
cout << c1[n] << endl;
}
return 0;
}