#include <bits/stdc++.h>
using namespace std;
#define all(p) p.begin(), p.end()
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)

#include<atcoder/modint>
using mint = atcoder::modint;

int main(){
    int N, M;
    cin >> N >> M;
    mint::set_mod(M);
    if (N % 3){
        cout << "0\n";
        return 0;
    }
    N /= 3;
    vector<mint> dp(1 + N), A(1 + N), B(1 + N);
    dp[0] = 1;
    A[0] = 1;
    B[0] = 1;
    rep(i, 1, N + 1){
        rep(j, 0, i){
            dp[i] += B[j] * dp[i - 1 - j];
        }
        // B[i] を求める
        rep(j, 0, i){
            A[i] += A[j] * B[i - j - 1];
            B[i] += (A[j] + B[j]) * B[i - j - 1];
        }
    }
    cout << dp[N].val() << "\n";
}