// Problem: B. 数列
// Contest: undefined - NOIP2024训练赛 04
// URL: http://noi.ac/contest/1156/problem/2157
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 1e6 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans, p;
int s[N], dp[N];

// vector<int> e[N];

inline int ksm(int a, int b)
{
	int res = 1;
	while(b)
	{
		if(b & 1) res = res * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return res;
}

signed main() 
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  	dp[0] = 1;
  	cin >> n >> p;
  	for(int i = 1; i <= n; i++) dp[i] = (dp[i - 1] * (4 * i - 2) % p) * ksm(i + 1, p - 2) % p;
	cout << dp[n] << '\n';
	return 0;
}