#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pii pair<int, int>
#define pll pair<LL, LL>
#define fi first
#define se second
#define mkp make_pair
#define sz(x) (int)x.size()
#define pb push_back
using namespace std;
bool Mst;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

int mod;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = (LL)res * a % mod;
		a = (LL)a * a % mod, b >>= 1;
	}
	return res;
}

auto fplus = [](int x, int y) {return x + y < mod ? x + y : x + y - mod;};
auto fminus = [](int x, int y) {return x >= y ? x - y : x + mod - y;};
auto Fplus = [](int &x, int y) {x = fplus(x, y);};
auto Fminus = [](int &x, int y) {x = fminus(x, y);};

int n, f[805][805];

bool Med;
signed main() {
	n = read(), mod = read();
	f[1][0] = 1;
	for (int i = 2; i <= n; i++)
		for (int x = 0; x <= n && x + i <= n; x++) {
			int inv = qpow(i - 1 + x, mod - 2);
			f[i][x] = f[i - 1][0];
			for (int j = 2; j <= i - 2; j++)
				Fplus(f[i][x], 1ll * f[i - j][x] % mod * fminus(f[j][0], f[j][i - j - 1 + x]) % mod);
			f[i][x] = 1ll * f[i][x] * inv % mod;
		}
	int ans = f[n][0];
	for (int i = 1; i < n; i++) ans = 1ll * ans * i % mod;
	printf("%d\n", ans);
	return 0;
}