#include <cstdio>

int f[805][805], fact[805], inv[805], n, mod;
int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % mod;
		a = 1ll * a * a % mod, b >>= 1;
	}
	return res;
}

int main() {
	scanf("%d%d", &n, &mod);
	fact[0] = 1;
	for (int i = 1; i <= n; ++ i) fact[i] = 1ll * fact[i - 1] * i % mod, inv[i] = qpow(i, mod - 2);
	f[1][0] = 1, f[0][0] = 1;
	for (int i = 2; i < n; ++ i)
	for (int j = 0; j < n - i && j < i; ++ j) {
		if (j >= 1) {
			for (int k = 0; k < i - 1; ++ k)
				f[i][j] = (f[i][j] - 1ll * f[k][0] * f[i - k - 1][j - 1]) % mod;
		}
		for (int k = 1; k < i - 1; ++ k)
			f[i][j] = (f[i][j] + 1ll * f[k][0] * f[i - k - 1][j]) % mod;
		f[i][j] = (f[i][j] + f[i - 1][j + 1]) % mod;
		if (!j) f[i][j] = (f[i][j] + f[i - 1][j]) % mod;
		f[i][j] = 1ll * f[i][j] * inv[i] % mod;
	}
	int ans = 1ll * f[n - 1][0] * fact[n - 1] % mod;
	printf("%d", (ans + mod) % mod);
	return 0;
}