#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1605;
int n,mod;
int fac[maxn],ifac[maxn],inv[maxn],f[maxn][maxn];
int qp(int a,int b){
	if(b==0)return 1;
	int t=qp(a,b>>1);
	t=(t*t)%mod;
	if(b&1)t=(t*a)%mod;
	return t;
}
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);cout.tie(0);
   cin>>n>>mod;
   fac[0]=1;
   for(int i=1;i<=n;i++)fac[i]=(fac[i-1]*i)%mod;
   ifac[n]=qp(fac[n],mod-2);
   for(int i=n-1;i>=0;i--)ifac[i]=(ifac[i+1]*(i+1))%mod;
   for(int i=1;i<=n;i++)inv[i]=ifac[i]*fac[i-1]%mod;
   f[1][0]=1;inv[0]=1;
   for(int i=2;i<=n;i++){
		for(int j=0;j<=n;j++){
			int res=f[i-1][0];
			for(int k=2;k<i-1;k++)(res+=(f[k][0]-f[k][i+j-k-1]+mod)%mod*f[i-k][j])%=mod;
			f[i][j]=res*inv[i+j-1]%mod;
			// cerr<<i<<" "<<j<<" "<<f[i][j]<<endl;
		}
   }
   cout<<f[n][0]*fac[n-1]%mod<<endl;
   return 0;
}