#include<bits/stdc++.h>
using namespace std;
const int N=4e5+5;

int n,P,fc[N],ifc[N];
int o,w,f[2][N][3],ad[N][3],ans,all;

//Fastmod 
struct Fastmod {
	#define ull unsigned long long
	#define ULL  __uint128_t
	const ull k=63;
	ull m,q,res; 
	inline void init(ull P) { m=(1ull<<k)/P; }
	inline int reduce(ull a) {
		q=(ull)((ULL(a)*m)>>k);
		res=a-P*q;
		return res;
	}
}Mod;
//calc
inline void inc(int &x,int y) { x+=y-P; x+=(x>>31)&P; }
inline void dec(int &x,int y) { x-=y; x+=(x>>31)&P; }
inline int pls(int x,int y) { return x+=y-P, x+=(x>>31)&P, x; }
inline int power(int a,int b) { int res=1; for(;b;b>>=1,a=1ll*a*a%P) if(b&1) res=1ll*res*a%P; return res; }

int main() {
	cin>>n>>P; Mod.init(P);
	
	fc[0]=ifc[0]=all=1; 
	for(int i=1;i<N;i++) fc[i]=1ll*i*fc[i-1]%P;
	ifc[N-1]=power(fc[N-1],P-2);
	for(int i=N-2;i>=1;i--) ifc[i]=1ll*ifc[i+1]*(i+1)%P;
	
	int *F, m=2*n; o=0; w=1; f[o][0][0]=1; 
	for(int i=0,up;i<=m;i++,swap(o,w)) {
		for(int j=0;j<3;j++) inc(f[o][0][j],ad[i][j]);
		if(i==m) break; 
		up=min(m-i+1,i);
		for(int k=0;k<=up;k++) {
			F = f[o][k];
			if(F[0]) inc(f[w][k+1][1],F[0]);
			if(F[1]) {
				inc(f[w][k+1][1],F[1]);
				if(k && i+k<=m) inc(ad[i+k][0],Mod.reduce(1ull*F[1]*
											   Mod.reduce(1ull*fc[m-i-1]*ifc[m-i-k])));
				if(k>1 && i+k<=m) inc(ad[i+k-1][2],Mod.reduce(1ull*
												   Mod.reduce(1ull*F[1]*(k-1))*
												   Mod.reduce(1ull*fc[m-i-1]*ifc[m-i-k+1])));
			}
			if(F[2]) {
				inc(f[w][k+1][2],F[2]);
				inc(f[w][k][0],F[2]);
			}
			F[0]=F[1]=F[2]=0;
		}
	}
	
	for(int i=1;i<=m;i+=2) all=1ll*all*i%P;
	dec(ans=all,f[o][0][0]);
	cout<<ans<<endl;
	
	return 0;
}