#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>

using namespace std;

int N, P;
#define NMAX 5000
long long dp[NMAX];
bool visited[NMAX];
long long  binom (int n, int k, int p) {
    // Base Cases
    if (k > n)
        return 0;
    if (k == 0 || k == n)
        return 1;

    return (binom(n - 1, k - 1,p)
           + binom(n - 1, k,p)) %p;
}
int main() {
   
     freopen("goblin.in","r",stdin);
    freopen("goblin.out","w",stdin);
    cin >> N >> P;
    // up pattern first
    dp[2] = 1; dp[1] = 1; dp[0] = 1;
    for (int i=3; i<=N; i++) {
        for (int j=2; j<=i; j += 2 ) {
            long long tmp = dp[j-1]*binom(i-1,j-1,P) %P;
            tmp = tmp *  dp[i-j] %P;
            dp[i] = (dp[i] + tmp) % P;
        }
    }
    if (N == 1) cout << 1;
    else cout << 2*dp[N] %P;
    return 0;
}