/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 5014;
int N;
LL dp[SIZE][SIZE],dp2[SIZE][SIZE];
void init_dp(){
    dp[0][0]=1;
    FOR(i,1,SIZE){
        REPP(j,i,SIZE){
            dp[i][j]=dp[i][j-i]+dp[i-1][j-1];
            if(dp[i][j]>=MOD)dp[i][j]-=MOD;
        }
    }
    REP(i,SIZE){
        REP(j,SIZE){
            if(i){
                dp[i][j]+=dp[i-1][j];
                if(dp[i][j]>=MOD)dp[i][j]-=MOD;
            }
            if(j){
                dp[i][j]+=dp[i][j-1];
                if(dp[i][j]>=MOD)dp[i][j]-=MOD;
            }
            if(i&&j){
                dp[i][j]-=dp[i-1][j-1];
                if(dp[i][j]<0)dp[i][j]+=MOD;
            }
            if(!j)dp2[i][j]=dp[i][j];
            else{
                dp2[i][j]=dp[i][j]+dp2[i][j-1];
                if(dp2[i][j]>=MOD)dp2[i][j]-=MOD;
            }
        }
    }
}
LL get(int num,int sum,int max_value){
    if(sum<0)return 0;
    if(!num)return 1;
    if(sum<=max_value) return dp[num][sum];
    if(num==1) return min(sum,max_value)+1;
    if(num==2) {
        LL ret=dp[2][sum];
        int ss=sum-max_value;
        ADD(ret,-ss*(ss+1)/2);
        return ret;
    }
    return dp[num][sum]-dp2[num-1][sum-max_value-1];
}
void solve(){
    if(N==2){
        W(3%MOD);
        return;
    }
    init_dp();
    int left_n=(N+1)/2;
    int right_n=left_n-1;
    LL an=0;
    FOR(x,1,N){
        FOR(y,x,N){
            if(left_n*x<=right_n*y)break;
            int value=left_n*x-right_n*y-1;
            if(N&1){
                FOR(i,0,value){
                    LL tmp=get(N-y,value-i,right_n-1);
                    ADD(an,(get(x-1,i,left_n-1)-get(x-1,i-1,left_n-1))*tmp);
                }
            }
            else{
                FOR(i,0,value){
                    LL tmp=get(N-y,value-i,right_n-1)*(y-x+1)%MOD;
                    ADD(an,(get(x-1,i,left_n-1)-get(x-1,i-1,left_n-1))*tmp);
                }
            }
        }
    }
    W(an);
}
int main(){
    int M;
    R(N,M);
    MOD=M;
    solve();
    return 0;
}


Measured memory_bytes: 393088