#include<bits/stdc++.h>
#define forup(i,s,e) for(int i=(s),E123123123=(e);i<=E123123123;++i)
#define fordown(i,s,e) for(int i=(s),E123123123=(e);i>=E123123123;--i)
#define mem(a,b) memset(a,b,sizeof(a))
#ifdef DEBUG
#define msg(args...) fprintf(stderr,args)
#else
#define msg(...) void()
#endif
using namespace std;
using i64=long long;
using pii=pair<int,int>;
#define fi first
#define se second
#define mkp make_pair
#define gc getchar()
int read(){
    int x=0,f=1;char c;
    while(!isdigit(c=gc)) if(c=='-') f=-1;
    while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=gc;}
    return x*f;
}
#undef gc
const int N=805,inf=0x3f3f3f3f;
int n,mod,dp[N][N];
int inv[N<<1];
signed main(){
    n=read();mod=read();
    inv[1]=1;
    forup(i,2,n*2){
        inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
    }
    forup(j,0,n-1){
        dp[1][j]=1;
    }
    forup(i,2,n){
        forup(j,0,n-i){
            int val=dp[i-1][0];
            forup(k,2,i-2){
                (val+=1ll*(dp[k][0]-dp[k][i-1-k+j]+mod)*dp[i-k][j]%mod)%=mod;
            }
            // msg("[%d %d]",val,inv[i+j-1]);
            dp[i][j]=1ll*inv[i+j-1]*val%mod;
            // msg("(%d)",dp[i][j]);
        }
        // msg("|\n");
    }
    int ans=dp[n][0];
    forup(i,1,n-1){
        ans=1ll*ans*i%mod;
    }
    printf("%d\n",ans);
}
/*
4 998244353

10 998244353

2 998244353

100 1000000007

*/