#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 805;
int n;
ll MOD, dp[MAXN][MAXN], jc[MAXN], ni[MAXN];
inline ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
int main() {
    n = read(), MOD = read();
    jc[0] = jc[1] = ni[0] = ni[1] = 1;
    for (ll i = 2; i <= n; i++) jc[i] = jc[i - 1] * i % MOD, ni[i] = (MOD - MOD / i) * ni[MOD % i] % MOD;
    dp[0][1] = dp[1][0] = dp[1][1] = 1;
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j <= min(i - 1, n - i + 1); j++) dp[i][j - 1] = dp[i - 1][j] * ni[i] % MOD;
        for (int j = 1; j <= min(i, n - i + 1); j++) {
            ll res = 0;
            for (int k = 2; k <= i - 1; k++) res = (res + dp[k - 1][1] * dp[i - k][j] % MOD) % MOD;
            dp[i][j] = (dp[i][j] + res * ni[i] % MOD) % MOD;
            if (j != min(i, n - i + 1)) dp[i][j + 1] = (dp[i][j + 1] - (res + dp[i - 1][j]) % MOD * ni[i] % MOD + MOD) % MOD;
        }
        dp[i][1] = (dp[i][1] + dp[i][0]) % MOD;
    }
    printf("%lld\n", dp[n][0] * jc[n] % MOD);
    return 0;
}