#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
int sol[105];
int i,j,n;
int main()
{
	FILE *in,*out;
	in=fopen("manevre.in","r");
	out=fopen("manevre.out","w");
	fscanf(in,"%d",&n);
	sol[1]={1,1};
	sol[0]={1,1};
	//sol[1]=1;
//	sol[0]=1;
	FOR (i,2,n)
	{
		FOR(j,0,i-1)
		{
			inmultire(aux,sol[j],sol[i-1-j]);
			adunare(sol[i],aux);
		//	sol[i]+=sol[j]*sol[i-1-j];
		}
	}
	for(i=sol[n][0];i>=1;i--)
		fprintf(out,"%d",sol[n][i]);
	fclose(in);
	fclose(out);
	return 0;
}