#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int maxn=4e5+10;
const int maxm=1e6+10;
const int mod=1e9+7;
const ull base1=233;
const ull base2=19260817;
const int maxxn=0x7fffffff;
const int minxn=-0x7fffffff;
const db inf=1e13;
const db eps=1e-8;
inline ll read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
int n,p;
int dp[5005][5005],sum;
int ans;
int main(){
    n=read(),p=read();
    dp[1][1]=1;
    for(int i=2;i<=n;i++){
        sum=0;
        if(i&1){
            dp[i][1]=0;
            for(int j=2;j<=i;j++){
                sum=(sum+dp[i-1][j-1])%p;
                dp[i][j]=sum;
            }
        }
        else{
            dp[i][i]=0;
            for(int j=i-1;j>=1;j--){
                sum=(sum+dp[i-1][j])%p;
                dp[i][j]=sum;
            }
        }
    }
    for(int i=1;i<=n;i++){
        ans=(ans+dp[n][i])%p;
    }
    ans=(ans*2)%p;
    printf("%d\n",ans);
    return 0; 
}