#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<queue>

#define LL long long

#define inf 2147483640

#define Pi acos(-1.0)

#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);

using namespace std;

int main() {

	int n,f[10010];

	scanf("%d",&n);

	f[0]=1;

	for (int i=1;i<=n;i++) f[i]=(LL)f[i-1]*(4*i-2)/(i+1);  //O(n)递推式

	printf("%d\n",f[n]);

	return 0;

}