#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long LL;

const int N = 805;

int n, P;
LL inv[N], f[N][N];

int main()
{
    scanf("%d%d", &n, &P);
    if(n <= 3) return puts("1"), 0;
    n -- ;
    inv[1] = 1;
    for(int i = 2; i <= n; i ++ ) inv[i] = inv[P % i] * (P - P / i) % P;
    f[0][0] = 1;
    for(int i = 0; i <= n; i ++ ) f[1][i] = inv[i + 1];
    for(int i = 2; i <= n; i ++ )
        for(int j = 0; j <= n - i; j ++ )
        {
            f[i][j] = f[i - 1][0];
            for(int k = 1; k < i - 1; k ++ )
            {
                f[i][j] += (f[i - 1 - k][0] + P - f[i - 1 - k][j + k]) * f[k][j];
                !(k & 7) && (f[i][j] %= P);
            }
            f[i][j] = f[i][j] % P * inv[i + j] % P;
        }
    LL fact = 1;
    for(int i = 1; i <= n; i ++ ) fact = fact * i % P;
    printf("%llu\n", f[n][0] * fact % P);
    return 0;
}