#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	int dp[14][14][14]; // [i][j][k] := 残り '(' i 個, ')' j 個, 深さ d
	memset(dp, -1, sizeof(dp));
	auto dfs = [&](auto self, int l, int r, int d) -> int {
		int & res = dp[l][r][d];
		if (~res) return res;
		if (l == 0 && r == 0) return d == 0;
		res = 0;
		
		if (l > 0) res += self(self, l - 1, r, d + 1);
		if (r > 0 && d > 0) res += self(self, l, r - 1, d - 1);
		
		return res;
	};
	cout << dfs(dfs, N, N, 0) << endl;
}