#include<bits/stdc++.h>
using namespace std;
#define int long long
struct IO{
	int rd()
	{
		int x=0,w=1;
		char c=getchar();
		while(c<'0'||c>'9')
		{
			if(c=='-') w=-1;
			c=getchar();
		}
		while(c>='0'&&c<='9')
		{
			x=(x<<3)+(x<<1)+c-'0';
			c=getchar();
		}
		return x*w;
	}
	void write(int x)
	{
		if(x<0) putchar('-'),x=-x;
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	void wt(int x,char c){write(x);putchar(c);}
}io;
int inv[200100];
int n,mod;
int dp[808][808];
signed main()
{
	// freopen("txt.in","r",stdin);
	// freopen("txt.out","w",stdout);
	// cin>>n;
	cin>>n>>mod;
	if(n==1){puts("1");return 0;}
	inv[1]=1;
	for(int i=2;i<=n;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
	dp[1][0]=1;
	for(int i=2;i<=n;i++)
	{
		for(int j=0;j<=i;j++)
		{
			dp[i][j]=(dp[i][j]+dp[i-1][j+1])%mod;
			if(j==0) dp[i][0]=(dp[i][0]+dp[i-1][0])%mod;
			for(int k=0;k<=i-j;k++)
			{
				dp[i][j]=(dp[i][j]+(dp[i-k][j]*dp[k-1][0]%mod))%mod;
				if(j) dp[i][j]=(dp[i][j]-1ll*(dp[i-k][j-1]*(dp[k-1][0]+(k==1)))%mod)%mod;
			}
			dp[i][j]=dp[i][j]*inv[i]%mod;
		}
	}
	int ans=dp[n-1][0]*inv[n];
	for(int i=1;i<=n;i++) ans=ans*i%mod;
	cout<<ans<<endl;
	// fclose(stdin);fclose(stdout);
	return 0;
}