//qoj6333
#include <bits/stdc++.h>
using namespace std;

const int N = 40010;
int n;
typedef long long ll;
ll P, f[N][2], fac[N], inv[N];

struct Mod{
    ll m, p;
    void init(int pp){
        m = ((__int128)1 << 64) / pp;
        p = pp;
    }
    ll operator ()(ll x){
        return x - ((__int128(x) * m) >> 64) * p;
    }
} mod;
void chk(ll &x){
    while(x >= P){
        x -= P;
    }
}

ll qp(ll x, ll y){
    ll ans = 1;
    while(y){
        if(y & 1){
            ans = mod(ans * x);
        }
        x = mod(x * x);
        y >>= 1;
    }
    return ans;
}
ll C(int n, int m){
    return mod(mod(fac[n] * inv[m]) * inv[n-m]);
}

int main(){
    scanf("%d%lld", &n, &P);
    mod.init(P);
    fac[0] = 1;
    for(int i = 1; i < N; ++ i){
        fac[i] = mod(fac[i-1] * i);
    }
    inv[N-1] = qp(fac[N-1], P-2);
    for(int i = N-2; i >= 0; -- i){
        inv[i] = mod(inv[i+1] * (i+1));
    }
    f[2][0] = f[1][1] = 1;
    for(int i = 1; i < n; ++ i){
        for(int j = 0; i + j <= n; ++ j){
            f[i+j+2][0] += mod(mod(f[i][0] * fac[i+i+j-3]) * mod(inv[i+i-3] * (j + 1) * (j + 2)));
            f[i+j+1][1] += mod(mod(f[i][0] * fac[i+i+j-3]) * mod(inv[i+i-3] * (j + 1)));
            f[i+j+2][0] += mod(mod(f[i][1] * fac[i+i+j-2]) * mod(inv[i+i-2] * (j + 1)));
            f[i+j+1][1] += mod(mod(f[i][1] * fac[i+i+j-2]) * mod(inv[i+i-2]));
            chk(f[i+j+2][0]);
            chk(f[i+j+1][1]);
        }
    }
    ll ans = 1, sum = 0;
    for(int i = n + n - 1; i >= 1; i -= 2){
        ans = mod(ans * i);
    }
    for(int i = n; i >= 1; -- i){
        int j = n - i;
        sum += mod(mod(f[i][0] * fac[i+i+j-3]) * mod(inv[i+i-3] * (j + 1)));
        sum += mod(f[i][1] * mod(fac[i+i+j-2] * inv[i+i-2]));
        chk(sum);
    }
    ans = ans + P - sum;
    printf("%lld\n", ans % P);
    return 0;
}