#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
ll m;
ll C[5003][5003];
ll fd[5003],wd[5003];
int main()
{
	ios_base::sync_with_stdio(0);
	int n;
	cin>>n>>m;
	C[0][0]=1;
	for(int i=0;i<=n;i++) for(int j=0;j<=i;j++)
	{
		C[i][j]%=m;
		C[i+1][j]+=C[i][j];
		C[i+1][j+1]+=C[i][j];
	}
	for(int i=2;i<=n;i+=2) for(int j=0;j<=i;j+=2) fd[i]+=C[i][j]*C[j][j/2]%m*C[i-j][(i-j)/2]%m;
	for(int i=2;i<=n;i+=2)
	{
		fd[i]%=m;
		wd[i]=fd[i];
		for(int j=2;j<i;j+=2) wd[i]+=m-wd[j]*fd[i-j]%m;
		wd[i]%=m;
	}
	ll ans=0;
	ll cmt=1;
	for(int i=0;i<n;i++)
	{
		ans+=m-cmt*wd[n-i]%m*(i+1)%m;
		cmt=cmt*4%m;
	}
	ans+=cmt*(n+1)%m;
	cout<<ans%m<<endl;
	return 0;
}