//dp f[i][j] =  f[i][j-i] + f[i-1][j-i]; ans = sum(f[i][n]) ,f[1][1] = 1;#include <iostream>using namespace std;const int maxB = 500;double f[maxB+1][maxB+1];int main(){	int i,j;	int n;	double sum = 0;	cin >> n;	memset( f,0,sizeof(f) );	f[1][1] = 1;	for( j = 2 ; j <= n ; j++ )		for( i = 1; i <= j; i++ )			f[i][j] = f[i][j-i] + f[i-1][j-i];	for( i = 2; i <= n; i++ )		sum += f[i][n];	printf("%.0lf\n",sum);}