#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=555;
typedef long long LL;
LL N,F[MAXN][MAXN]={0};
int main()
{
	freopen("runa.in", "r", stdin);
	freopen("runa.out", "w", stdout);
	scanf("%lld", &N); 
	for(int i=1;i<=N;i++) F[i][i]=1LL;
	for(int i=2;i<=N;i++)
		for(int j=1;j<=i;j++)
			for(int k=1;k<=j-1;k++)
				F[i][j]+=F[i-j][k];
	LL ans=0;
	for(int i=1;i<=N-1;i++)
		ans+=F[N][i];
	printf("%lld\n",ans);
	return 0;
}