#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <ctime>
#include <random>
#include <cassert>
#include <numeric>
#include <cmath>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#define pii pair<int, int>
#define fi first
#define se second
#define MP make_pair
#define ep emplace
#define eb emplace_back
#define int long long
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (j); i >= (k); i--)
typedef double db;
typedef long double ldb;
typedef long long ll;
//typedef __int128 lll;
typedef unsigned long long ull;
typedef unsigned int ui;
using namespace std;
using namespace __gnu_pbds;
bool Mbe;

//char buf[1<<20],*p1,*p2;
//#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
int read() {
	int s = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
	return f ? s : -s;
}
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(x>y)x=y;}

const int N=5005;
int n,mod,pw[N],ans,a[N],b[N],C[N][N],f[N];

bool Med;
signed main() {
	fprintf(stderr,"%.3lfMb\n",(&Mbe-&Med)/1024./1024.);
	n=read(),mod=read();
	pw[0]=1;
	rep(i,1,n)pw[i]=pw[i-1]*4%mod;
	rep(i,0,n){
		C[i][0]=1;
		rep(j,1,i)C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
	}
	rep(i,0,n/2){
		a[i]=C[i+i][i]*C[i+i][i]%mod;
		rep(j,1,i-1)a[i]=(a[i]-a[i-j]*C[j+j][j]%mod*C[j+j][j]%mod+mod)%mod;
	}
	f[0]=1;
	ans=pw[n];
	rep(i,1,n){
		if(i&1)f[i]=4*f[i-1]%mod;
		else f[i]=(4*f[i-1]-a[i/2]+mod)%mod;
		ans=(ans+pw[n-i]*f[i])%mod;
	}
	printf("%lld\n",ans);
	return 0;
}