#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define double long double
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=805,M=15,S=(1<<8)+5,inf=(ll)1e18+7;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int n,mo;
int f[N][N],inv[N];
int quick_power(int base,int x){
    int res=1;
    while(x){
        if(x&1)res*=base,res%=mo;
        base*=base,base%=mo;
        x>>=1;
    }
    return res;
}
signed main(){
    read(n),read(mo);
    rep(i,1,n)
        inv[i]=quick_power(i,mo-2);
    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){
                int res=f[k][0]+mo-f[k][i-1-k+j];
                res*=f[i-k][j],res%=mo;
                f[i][j]+=res,f[i][j]%=mo;
            }
            f[i][j]*=inv[i+j-1],f[i][j]%=mo;
        }
    }
    int ans=f[n][0];
    rep(i,1,n-1)
        ans*=i,ans%=mo;
    printf("%lld\n",ans);
}