/*
ID: LinKArftc
PROG: 1028.cpp
LANG: C++
*/

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <utility>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define eps 1e-8
#define randin srand((unsigned int)time(NULL))
#define input freopen("input.txt","r",stdin)
#define debug(s) cout << "s = " << s << endl;
#define outstars cout << "*************" << endl;
const double PI = acos(-1.0);
const double e = exp(1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
typedef long long ll;

const int maxn = 150;
int dp[maxn][maxn];

int dfs(int last, int res) {
    if (res <= 0) return 1;
    if (dp[last][res]) return dp[last][res];
    int ret = 0;
    if (last >= res) {
        for (int i = res; i >= 1; i --) {
            ret += dfs(i, res - i);
        }
    } else {
        for (int i = last; i >= 1; i --) {
            ret += dfs(i, res - i);
        }
    }
    dp[last][res] = ret;
    return ret;
}

int main() {
    int n;
    while (~scanf("%d", &n)) {
        int ans = 0;
        memset(dp, 0, sizeof(dp));
        for (int i = n; i >= 1; i --) ans += dfs(i, n - i);
        printf("%d\n", ans);
    }

    return 0;
}