// 
/*
世界の果てさえ
【世界的尽头在何处】
仆らは知らない
【我们也无从知晓】
*/
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <random>
#include <ctime>
#define pr pair <int, int>
#define mr make_pair
#define LL long long
#define ls tree[p].L
#define rs tree[p].R
using namespace std;
const int MAXN = 805;
int n, Mod, invv[MAXN];
LL dp[MAXN][MAXN];
void read(int &x) {
	x = 0; bool f = 1; char C = getchar();
	for(; C < '0' || C > '9'; C = getchar()) if(C == '-') f = 0;
	for(; C >= '0' && C <= '9'; C = getchar()) x = (x << 1) + (x << 3) + (C ^ 48);
	x = (f ? x : -x);
}
LL Qpow(LL x, int y) {
	LL ans = 1;
	for(; y; y >>= 1) {
		if(y & 1) ans = ans * x % Mod;
		x = x * x % Mod;
	}
	return ans;
}
int main() {
	read(n); read(Mod); dp[1][0] = 1;
	for(int i = 1; i <= n; i ++) invv[i] = Qpow(i, Mod - 2);
	for(int i = 2; i <= n; i ++) {
		for(int j = 0; j <= n - i; j ++) {
			for(int k = 2; k <= i - 2; k ++) {
				dp[i][j] = (dp[i][j] + (dp[k][0] - dp[k][i - k - 1 + j]) * dp[i - k][j]) % Mod;
			}
//			printf("|%d %d %lld|\n", i, j, dp[i][j]);
			dp[i][j] = (dp[i - 1][0] + dp[i][j]) % Mod;
			dp[i][j] = dp[i][j] * invv[i + j - 1] % Mod;
//			printf("|%d %d %lld|\n", i, j, dp[i][j]);
		}
	}
	LL ans = dp[n][0];
	for(int i = 1; i <= n - 1; i ++) ans = ans * i % Mod;
	printf("%lld", (ans + Mod) % Mod);
	return 0;
}