#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N = 5e6 + 5; int M;
namespace Count {
	int f[N], v[N];
	int qpow(int b, int p) {
		int r = 1;
		while(p) {
			if(p % 2) r *= b, r %= M;
			p /= 2;
			b *= b, b %= M;
		}
		return r;
	}
	void init(int n) {
		f[0] = 1;
		for(int i = 1; i <= n; i++) f[i] = f[i - 1] * i, f[i] %= M;
		int m = min(n, M - 1);
		v[m] = qpow(f[m], M - 2);
		for(int i = m - 1; i >= 0; i--) v[i] = v[i + 1] * (i + 1), v[i] %= M;
	}
	int get(int a, int b) {
		if(a < b) return 0;
		else return (f[a] * v[b] % M) * v[a - b] % M;
	}
	int lucas(int a, int b) {
		if(!b) return 1;
		else return (get(a % M, b % M) * lucas(a / M, b / M)) % M;
	}
	int cat(int x) {
		return (get(x * 2, x) - get(x * 2, x - 1) + M) % M;
	}
};
int n, ans, f[N];
void solve() {
	Count::init(n); n--, ans = 0; // cout<<"n = "<<n<<endl;
	if(!n) {
		cout<<0<<endl;
		return;
	}
	f[0] = 1; for(int i = 1; i <= n + 1; i++) f[i] = f[i - 1] * 2 % M;
	for(int i = 0; i <= n; i++) 
		ans += f[i] * Count::get(n, n - i) % M * Count::get(n, n - i + 1) % M,
		// ans += ((!((n - i) % 2) * 2 - 1) * (f[i] * Count::get(n + i, n - i) % M * Count::cat(i) % M) + M) % M,
		// cout<<(!((n - i) % 2) * 2 - 1)<<" * "<<f[i]<<" * "<<Count::get(n + i, n - i)<<" * "<<Count::cat(i)<<endl,
		ans %= M;
	ans = (Count::f[n + 1] - ans * Count::qpow(n, M - 2) % M + M) % M;
	cout<<ans<<endl;
}
signed main() {
	// int t; cin>>t;
	while(cin>>n>>M) solve();
}