#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const ll N = 805; ll mod;
ll pw(ll x,ll y){
    ll ans = 1;
    while (y){
        if (y&1) ans = ans*x %mod;
        x = x*x %mod;
        y >>= 1;
    }
    return ans;
}
ll n;
ll inv[N];
ll f[N][N];
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j,k;
    read(n); read(mod);
    f[0][0] = 1;
    inv[0] = 1;
    fr(i,1,n) inv[i] = pw(i,mod-2);
    fr(i,1,n){
        fr(j,0,n-i){
            f[i][j] = f[i-1][0];//1.
            fr(k,2,i-2){
                // ( f[i][j] += f[k][0] * f[i-k][j] ) %=mod;
                // ( f[i][j] += f[k][j] * (f[i-k][0]-f[i-k][j+k]) ) %=mod;
                ( f[i][j] += f[i-k][j] * (f[k][0]-f[k][j+i-k-1]) ) %=mod;//2.
            }
            f[i][j] = f[i][j]*inv[i+j-1] %mod;//3.
            // printf("f[%lld][%lld] = %lld\n",i,j,f[i][j]);
        }
    }
    ll ans = f[n][0];
    fr(i,1,n-1) ans = ans*i %mod;
    ans = (ans%mod+mod)%mod; write(ans);
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2