#include<bits/stdc++.h>
using namespace std;
int n,ans = 0;
void dfs(int x,int cnt) {
if (x == 0) {
ans++;
return;
}
if (x<0){
return;
}
for (int i = cnt;i <= n;++i) {
dfs(x-i,i);
}
}
int main() {
cin >> n;
dfs(n,1);
cout << ans;
return 0;
}