#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll f[505][505];
//f[i][j]:=go i circles with at least j circles at first
int main()
{
freopen("runa.in","r",stdin);
freopen("runa.out","w",stdout);
int n;
cin>>n;
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++)
for(int j=0;j<i;j++)
f[i][j]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<i;j++)
for(int k=1; ;k++)
if(i>=j+k)f[i][j]+=f[i-j-k][j+k];
else break;
cout<<f[n][0]-1<<endl;
return 0;
}