#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=2147483648;
const int N=4010;
ll f[N];
int main(){
int n;scanf("%d",&n);
f[0]=1;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
f[j]=(f[j]+f[j-i])%mod;
}
}
printf("%lld\n",(f[n]==0?mod-1:f[n]-1));
return 0;
}