#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iterator>
#include <iostream>
#include <algorithm>
#define debug(a) cout << #a << " " << a << endl
using namespace std;
const int maxn = 2*1e2 + 10;
const int mod = 10000;
typedef long long ll;
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll n;
    while( cin >> n ) {
        ll a[maxn], b[maxn];
        for( ll i = 0; i <= n; i ++ ) {
            a[i] = 1, b[i] = 0;
        }
        for( ll i = 2; i <= n; i ++ ) { //最低是从2开始划分
            for( ll j = 0; j <= n; j ++ ) {
                for( ll k = 0; k*i+j <= n; k ++ ) {
                    b[k*i+j] += a[j];
                }
            }
            for( ll j = 0; j <= n; j ++ ) {
                a[j] = b[j], b[j] = 0;
            }
        }
        cout << a[n] << endl;
    }
    return 0;
}