#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
//#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

// dp[k][nadmiar] - ile jest ciagow niemalejacych dlugosci x (ustalone),  
const int N = 5e3 + 5;
int dp[N][N][2];
int max_wys[N];
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n, P;
  cin>>n>>P;
  //VI xs{n / 2, n / 2 - 1 + (n % 2)};
  //debug(xs);
  
  //dp[0][0][0] = 1;
  REP (i, n) {
    dp[0][i][0] = 1;
  }
//   VI ts{1, 1};
  int x = n / 2;
  int ts = 1;
  RE (i, x) {
//     if (i >= 2) {
//       FOR (prv_nadmiar, 0, n) {
//         REP (old_wys, max_wys[i - 2] + 1) {
//           dp[ts][prv_nadmiar][old_wys] = 0;
//         }
//       }
//     }
    FOR (nadmiar, 0, n) {
      FOR (wys, 0, n) {
        if ((x - i) * wys > n) { break; }
        //maxi(max_wys[i], wys);
        if (wys >= 1) {
          dp[nadmiar][wys][ts] = dp[nadmiar][wys - 1][ts];
        } else {
          dp[nadmiar][wys][ts] = 0;
        }
        if (nadmiar >= wys) {
          dp[nadmiar][wys][ts] = dp[nadmiar][wys][ts] + dp[nadmiar - wys][wys][ts ^ 1];
          if (dp[nadmiar][wys][ts] >= P) {
            dp[nadmiar][wys][ts] -= P;
          }
        }
//         if (wys && nadmiar >= x - i + 1) {
//           dp[ts][nadmiar][wys] = (dp[ts][nadmiar][wys] + dp[ts][nadmiar - (x - i + 1)][wys - 1]);
//           if (dp[ts][nadmiar][wys] >= P) {
//             dp[ts][nadmiar][wys] -= P;
//           }
//         }
        //debug(t, nadmiar, wys, dp[t][nadmiar][wys]);
      }
    }
    ts ^= 1;
  }
  ts ^= 1;
  //debug(1.0 * clock() / CLOCKS_PER_SEC);
  debug(ts);
//   REP (tt, 2) {
//     FOR (nadmiar, 0, n) {
//       RE (wys, n) {
//         dp[tt][nadmiar][wys] = (dp[tt][nadmiar][wys - 1] + dp[tt][nadmiar][wys]);
//         if (dp[tt][nadmiar][wys] >= P) {
//           dp[tt][nadmiar][wys] -= P;
//         }
//       }
//     }
//   }
  debug(1.0 * clock() / CLOCKS_PER_SEC);
  int to_pref = ts;
  if (n % 2 == 0) {
    to_pref ^= 1;
  }
  vector<vector<int>> prefed(n + 2, VI(n + 2));
  
  REP (nad, n + 1) {
    REP (wys, n + 1) {
      prefed[nad][wys] = dp[nad][wys][to_pref];
      if (nad) {
        prefed[nad][wys] = (prefed[nad][wys] + prefed[nad - 1][wys]);
        if (prefed[nad][wys] >= P) {
          prefed[nad][wys] -= P;
        }
      }
    }
  }
  debug(1.0 * clock() / CLOCKS_PER_SEC);
  debug(prefed[1][1]);
  long long res = 0;
  RE (ax, n) {
    REP (sum_left, ax) {
      int wklad = 1ll * dp[sum_left][ax - 1][ts] * prefed[ax - sum_left - 1][n - ax] % P;
      //debug("at", ax, sum_left, wklad, dp[ts][sum_left][ax - 1], prefed[ax - sum_left - 1][n - ax]);
      res = (res + wklad);
//       if (res >= P) {
//         res -= P;
//       }
    }
  }
  debug(1.0 * clock() / CLOCKS_PER_SEC);
  cout<<res % P<<endl;
    
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 293760