#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

int mod;
typedef unsigned long long ull;
namespace FM{
	typedef __uint128_t L;
	struct FastMod{
		ull b,m;
		FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){}
		ull reduce(ull a){ull q=(ull)((L(m)*a)>>64),r=a-q*b;return r>=b?r-b:r;}
	};
	FastMod F(2);
}

struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=FM::F.reduce(1ull*x*o.x),*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}
void initmod(){mod=read(),FM::F=FM::FastMod(mod);}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi; 

#define maxn 300005
#define inf 0x3f3f3f3f
#define ll long long 

int n;

modint f[20005][3],g[20005][3],tmp[40005][2]; 
modint prod(int m,int n){
	return fac[n]*ifac[m-1];
}

signed main()
{
	n=read(); initmod(); initC(n*4);
	f[0][2]=1;
	/*
	0 : bad 无可取的线头 
	1 : bad 少了 1 且 bad 有可取的线头
	2 : bad 有可取的线头
	*/
	For(i,2,n*2){
		int mx=min(n*2-i+1,i);
		For(j,0,mx){
			if(f[j][0].x){
				g[j][2]+=f[j][0];
			}
			if(f[j][2].x){
				g[j+1][2]+=f[j][2];
				if(i+j<=n*2) tmp[i+j][0]+=f[j][2]*fac[2*n-i]*ifac[2*n-i-j];
				if(j && i+j<=n*2) tmp[i+j-1][1]+=f[j][2]*j*fac[2*n-i]*ifac[2*n-i-j+1];
			}
			if(f[j][1].x){
				g[j+1][1]+=f[j][1];
				g[j][0]+=f[j][1];
			}
		}
		mx=min(n*2-(i+1)+1,i+1);
		For(c,0,1) g[0][c]+=tmp[i][c];
		For(j,0,mx) For(c,0,2) f[j][c]=g[j][c],g[j][c]=0;
	}
	modint res=f[0][0];
	modint mul=1;
	for(int i=n*2-1;i>=1;i-=2)mul*=i;
//	cout<<res.x<<'\n';
	cout<<(mul-res).x<<"\n";
	return 0;
}