/* name: 8047
 * author: 5ab
 * created at: 2024-04-14
 */
#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
const int N = 800;

int f[N + 1][N + 1], fac[N + 1], ifac[N + 1], inv[N + 1];

ll qpow(ll bs, ll ix, int mod)
{
	ll mul = bs, ret = 1;
	while (ix)
	{
		if (ix & 1)
			ret = (ret * mul) % mod;
		mul = (mul * mul) % mod;
		ix >>= 1;
	}
	return ret;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, mod;
	
	cin >> n >> mod;
	ll mmod = 1ll * mod * mod;
	
	fac[0] = 1;
	for (int i = 0; i < n; i++)
		fac[i + 1] = 1ll * fac[i] * (i + 1) % mod;
	ifac[n] = qpow(fac[n], mod - 2, mod);
	for (int i = n; i > 0; i--)
	{
		ifac[i - 1] = 1ll * ifac[i] * i % mod;
		inv[i] = 1ll * ifac[i] * fac[i - 1] % mod;
	}
	
	f[0][1] = f[1][0] = f[1][1] = 1;
	for (int i = 2; i <= n; i++)
	{
		int jl = min(i, n - i + 1);
		for (int j = 1; j <= min(i - 1, n - i + 1); j++)
			f[i][j - 1] = 1ll * f[i - 1][j] * inv[i] % mod;
		for (int j = 1; j <= jl; j++)
		{
			ll sm = 0;
			for (int k = 2; k < i; k++)
			{
				sm += 1ll * f[k - 1][1] * f[i - k][j];
				if (sm >= mmod) sm -= mmod;
			}
			f[i][j] = (f[i][j] + sm % mod * inv[i]) % mod;
			if (j != jl)
				f[i][j + 1] = (f[i][j + 1] - (sm + f[i - 1][j]) % mod * inv[i] % mod + mod) % mod;
		}
		
		f[i][1] = (f[i][1] + f[i][0]) % mod;
		// cerr << i << " ";
		// for (int j = 0; j <= i; j++)
		// 	cerr << 1ll * f[i][j] * fac[i] % mod << " \n"[j == i];
	}
	cout << 1ll * f[n][0] * fac[n] % mod << endl;
	
	return 0;
}
// started coding at: 04-14 19:59:40