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

#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i<=y;i--)

typedef long long ll;

const int N=805;

int n,mod;
ll iv[N];

ll qpow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1)res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}

void init(){
    for(int i=1;i<=n;i++){
        iv[i]=qpow(i,mod-2);
    }
}

ll f[N][N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>mod;
    init();
    f[1][0]=1;
    rep(i,2,n){
        rep(j,0,n-i){
            f[i][j]=f[i-1][0];
            rep(k,2,i-2){
                f[i][j]=(f[i][j]+(f[k][0]-f[k][i-1-k+j]+mod)%mod*f[i-k][j]%mod)%mod;
            }
            f[i][j]=f[i][j]*iv[i+j-1]%mod;
        }
    }
    ll ans=f[n][0]*iv[n]%mod;
    rep(i,2,n)ans=ans*i%mod;
    cout<<ans;
    return 0;
}