#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned uint;
const int N = 805;
int n , mod , c[N][N] , f[N][N];
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	cin >> n >> mod;
	for(int i = 0 ; i <= n ; i++)
	{
		c[i][0] = 1;
		for(int j = 1 ; j <= i ; j++)
		{
			uint t = c[i - 1][j - 1] + c[i - 1][j];
			c[i][j] = (t >= (uint)mod ? t - mod : t);
		}
	}
	for(int i = 0 ; i <= n ; i++)
		f[0][i] = f[1][i] = 1; 
	for(int i = 2 ; i <= n ; i++)
	{
		for(int j = 0 ; i + j <= n ; j++)
		{
			for(int x = 1 ; x <= i - 2 ; x++)
			{
				int y = i - 1 - x;
				f[i][j] = (f[i][j] + (ll)f[y][j] * ((ll)f[x][0] * c[i - 1 + j][x] % mod - f[x][y + j])) % mod;
			}
			f[i][j] = (f[i][j] + (ll)f[i - 1][0] * c[i - 1 + j][i - 1]) % mod;
			// cerr << i << ',' << j << " " << f[i][j] << "\n";
		}
	}
	cout << (f[n - 1][0] + mod) % mod << "\n";
	return 0;
}