#include <bits/stdc++.h>
using namespace std;
long long mod, n, ans = 1;
int cnt, c[2000001], z[5000001];
long long qp(long long a, long long b)
{
	long long ans = 1, l = a;
	while (b)
	{
		if (b & 1)
			ans = (ans * l) % mod;
		l = (l * l) % mod;
		b >>= 1;
	}
	return ans;
}
int main()
{
	scanf("%lld%lld", &n, &mod);
	for (int i = 2; i <= n * 2; ++i)
	{
		if (!c[i])
			z[++cnt] = i;
		for (int j = 1; j <= cnt && z[j] * i <= 2 * n; j++)
		{
			c[z[j] * i] = 1;
			if (i % z[j] == 0)
				break;
		}
	}
	for (int i = 1; i <= cnt; ++i)
	{
		long long s = 0, now = n * 2;
		while (now)
			s += now / z[i], now /= z[i];
		now = n;
		while (now)
			s -= now / z[i], now /= z[i];
		now = n + 1;
		while (now)
			s -= now / z[i], now /= z[i];
		ans = (ans * qp(z[i], s) % mod);
	}
	printf("%lld", ans);
}