#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize 03
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <ctime>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <random>
#include <numeric>
#include <unordered_set>

typedef long long ll;
typedef long double lb;

#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define file_in freopen("input.txt", "r", stdin);
#define file_in_out freopen("knapsack.in", "r", stdin); freopen("knapsack.out", "w", stdout);
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

template<typename T>
istream& operator>>(istream &in, vector<T> &v) {
    for (auto &it : v) {
        in >> it;
    }
    return in;
}

template<typename T>
ostream& operator<<(ostream &out, vector<T> &v) {
    if (!v.empty()) {
        out << v.front();
        for (int i = 1; i < v.size(); ++i) {
            out << " " << v[i];
        }
    }
    return out;
}

int main() {
    fast
//  file_in
//  file_in_out

    int n, m;
    cin >> n >> m;
    vector<ll> C(n + 1, 0);
    C[0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j <= i - 1; ++j) {
            C[i] += (C[j] * C[i - j - 1]) % m;
            C[i] %= m;
        }
    }
    cout << C[n] % m;
    return 0;
}