#include<bits/stdc++.h>
using namespace std;
const int maxn=800;
int n,mod;
int dp[maxn+5][maxn+5];
int power(int u,int v,int w){
    int res=1;
    while(v){
        if(v&1){
            res=1ll*res*u%w;
        }
        u=1ll*u*u%w;
        v>>=1;
    }
    return res;
}
signed main(){
    scanf("%d%d",&n,&mod);
	dp[1][0]=1;
	for(int i=2;i<=n;i++){
        for(int j=0;j<=n-i;j++){
            dp[i][j]=dp[i-1][0];
            for(int k=2;k<=i-2;k++){
                dp[i][j]=(dp[i][j]+1ll*(dp[k][0]-dp[k][i-k+j-1]+mod)%mod*dp[i-k][j]%mod)%mod;
            }
            dp[i][j]=1ll*dp[i][j]*power(i+j-1,mod-2,mod)%mod;
        }
    }
    for(int i=2;i<=n-1;i++){
        dp[n][0]=1ll*dp[n][0]*i%mod;
    }
    printf("%d\n",dp[n][0]);
}