#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 810;
int n, mod, f[N][N];
int inv[N];
int sub(int x, int y) {if ((x -= y) < 0) x += mod; return x; }
int power(int x, int y) {
	int ret = 1;
	while (y) {
		if (y & 1) ret = ret * x % mod;
		x = x * x % mod, y >>= 1;
	}
	return ret;
} 
int get_inv(int x) {return power(x, mod - 2); }
void init() {
	for (int i=1; i<=n; ++i)
		inv[i] = get_inv(i);
}

signed main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> mod;
	if (n == 1) {
		cout << "1\n"; return 0;
	}
	init();
	for (int j=0; 2+j<=n; ++j) f[2][j] = inv[j + 1];
	for (int i=3; i<=n; ++i)
		for (int j=0; i+j<=n; ++j) {
			f[i][j] = f[i - 1][0];
			for (int k=2; k<=i-2; ++k)
				f[i][j] = (f[i][j] + sub(f[k][0], f[k][i - 1 - k + j]) * f[i - k][j]) % mod;
			f[i][j] = f[i][j] * inv[i - 1 + j] % mod;
		}
	int ans = f[n][0];
	for (int i=1; i<n; ++i) ans = ans * i % mod;
	cout << ans << "\n";
	return 0;
}