#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {

    int N;
    cin >> N;

    long long dp[14*2][14] = {0};

    dp[0][0] = 1;

    for ( int i = 0; i < N*2; i++ ) {
        for ( int j = 0; j <= N; j++ ) {
            if ( j+1 <= N && (i+2)/2 <= j+1 ) {
                dp[i+1][j+1] += dp[i][j];
            }
            if ( i-j < N && (i+2)/2 <= j ) {
                dp[i+1][j] += dp[i][j];
            }
        }
    }

    cout << dp[2*N][N] << endl;

    return 0;
}