#include<bits/stdc++.h>
#define int long long
#define M 805
using namespace std;
int n, mod, mul[M], inv[M], dp[M][M];
int qpow(int x, int ti)
{
	int ret = 1;
	while(ti)
	{
		if(ti & 1) ret = ret * x % mod;
		x = x * x % mod;
		ti >>= 1;
	}
	return ret;
}
signed main()
{
	scanf("%lld%lld", &n, &mod);
	if(n == 1) return puts("1"), 0;
	mul[0] = 1;
	for(int i = 1; i <= n; i++) mul[i] = mul[i - 1] * i % mod;
	inv[n] = qpow(mul[n], mod - 2);
	for(int i = n - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
	dp[0][0] = 1;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= i; j++)
		{
			dp[i][j] = dp[i - 1][j - 1];
			for(int k = 1; k < i; k++) (dp[i][j] += dp[k][1] * dp[i - k - 1][j - 1]) % mod;
			for(int k = 1; k < i - 1; k++) (dp[i][j] += dp[k][1] * dp[i - k - 1][j]) % mod;
			(dp[i][j] += mod - dp[i - 1][j + 1]) %= mod;
			(dp[i][j] *= inv[i] * mul[i - 1] % mod) %= mod;
		}
	}
	printf("%lld\n", dp[n - 1][1] * mul[n - 1] % mod);
	return 0;
}