#include<bits/stdc++.h>
using namespace std;
typedef long long ll; 
typedef __int128 lll;
int F[805][805],fac[805],inv[805]; 
struct Kasumul{
    int p; ll m;
    Kasumul(int tp=998244353):p(tp),m(ll((lll(1)<<63)/tp)){}
    ll calc(ll x){
        ll q=((lll(x)*m)>>63);
        return x-q*p;
    }
};
int main(){
//	freopen("tree.in","r",stdin);
//	freopen("tree.out","w",stdout);
	int n,P;
	cin>>n>>P;
	Kasumul modint=Kasumul(P);
	fac[0]=inv[1]=1;
	for(int i=1;i<=n;++i)
		fac[i]=1ll*fac[i-1]*i%P;
	for(int i=2;i<=n;++i)
		inv[i]=P-1ll*(P/i)*inv[P%i]%P;
	F[1][0]=1;
	for(int i=2;i<=n;++i)
		for(int j=0;j<=n-i;++j){
			F[i][j]=F[i-1][0];
			for(int k=2;k+1<i;++k)
				F[i][j]=modint.calc(F[i][j]+1ll*(F[k][0]-F[k][i-k-1+j])*F[i-k][j]);
			F[i][j]=1ll*F[i][j]*inv[i+j-1]%P;
		}
	cout<<(1ll*F[n][0]*fac[n-1]%P+P)%P;
}