#include <bits/stdc++.h>
#define db double
#define re 
#define il inline
#define ll long long
#define ull unsigned ll
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
using namespace std;
#define N 805
int P;
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
int n, dp[N][N], f[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> P;
  dp[1][0] = f[1] = 1;
  FOR(i, 2, n) {
    f[i] = dp[i - 1][0];
    int inv = qpow(i);
    FOR(j, 0, i) {
      addr(dp[i][j], dp[i - 1][j + 1]);
      if(j == 0) addr(dp[i][j], dp[i - 1][0]);
      FOR(k, 1, i - 1) {
        addr(dp[i][j], 1ll * dp[i - k][j] * dp[k - 1][0] % P);
        if(j > 0) addr(dp[i][j], P - 1ll * dp[i - k][j - 1] * f[k] % P);
      }
      dp[i][j] = 1ll * dp[i][j] * inv % P;
    }
  }
  int ns = 1ll * f[n] * qpow(n) % P;
  FOR(i, 1, n) ns = 1ll * ns * i % P;
  cout << ns;
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}