#include<bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define mm(a, b) memset(a, b, sizeof(a))
#define ll long long
#define mp make_pair
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f, mod = 1e9 + 7;
const ll N = 2e5;

using namespace std;

// 高精度加法
string add(const string& num1, const string& num2) {
    int i = num1.size() - 1;
    int j = num2.size() - 1;
    int carry = 0;
    string result;

    while (i >= 0 || j >= 0 || carry > 0) {
        int sum = carry;
        if (i >= 0) sum += num1[i--] - '0';
        if (j >= 0) sum += num2[j--] - '0';
        carry = sum / 10;
        result.push_back(sum % 10 + '0');
    }

    reverse(result.begin(), result.end());
    return result;
}

// 高精度乘法
string mul(const string& num1, const string& num2) {
    int m = num1.size(), n = num2.size();
    vector<int> pos(m + n, 0);

    for (int i = m - 1; i >= 0; i--) {
        for (int j = n - 1; j >= 0; j--) {
            int mult = (num1[i] - '0') * (num2[j] - '0');
            int p1 = i + j, p2 = i + j + 1;
            int sum = mult + pos[p2];
            pos[p1] += sum / 10;
            pos[p2] = sum % 10;
        }
    }

    string result;
    for (int p : pos) {
        if (!(result.empty() && p == 0)) {
            result.push_back(p + '0');
        }
    }

    return result.empty() ? "0" : result;
}

int main() {
    ios;

    int n;
    cin >> n;
    vector<string> f(n + 1);
    f[0] = "1";
    f[1] = "1";

    for (int i = 2; i <= n; i++) {
        for (int j = 0; j < i; j++) {
            f[i] = add(f[i], mul(f[j], f[i - j - 1]));
        }
    }

    cout << f[n];
    return 0;
}