1 #include <map>
 2 #include <queue>
 3 #include <cmath>
 4 #include <vector>
 5 #include <string>
 6 #include <cstdio>
 7 #include <cstring>
 8 #include <climits>
 9 #include <iostream>
10 #include <algorithm>
11 #define INF 0x3f3f3f3f
12 #define LL long long
13 using namespace std;
14 const int MAX = 2e2 + 10;
15 
16 int n, ans[MAX], temp[MAX];
17 
18 void calc()
19 {
20     for (int i = 0; i <= 130; ++ i)
21         ans[i] = 1, temp[i] = 0;
22     for (int i = 2; i <= 130; ++ i)
23     {
24         for (int j = 0; j <= 130; ++ j)
25             for (int k = 0; j + k <= 130; k += i)
26                 temp[j + k] += ans[j];
27         for (int j = 0; j <= 130; ++ j)
28             ans[j] = temp[j], temp[j] = 0;
29     }
30 }
31 
32 int main()
33 {
34     calc();
35     while (~scanf("%d", &n))
36         printf("%d\n", ans[n]);
37     return 0;
38 }