#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n; cin>>n;
	ll dp[14][14]={};
	dp[0][0]=1;
	for(int i=0; i<=n; i++){
		for(int j=0; j<=n; j++){
			if(i+1<=n && i+1>=j) dp[i+1][j]+=dp[i][j];
			if(j+1<=n && i>=j+1) dp[i][j+1]+=dp[i][j];
		}
	}
	cout<<dp[n][n]<<endl;
	return 0;
}