// H
#include <bits/stdc++.h>
#define int long long

using namespace std;
int n, Mod;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int qpow(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1)
            ans = ans * a % Mod;
        a = a * a % Mod;
        b >>= 1;
    }
    return ans;
}
string binary_change(int x) {
    string ans = "";
    for (int i = 1; i <= n; i++) {
        ans = (char)(x % 2 + '0') + ans;
        x /= 2;
    }
    return ans;
}
int flcs(string s) {
    int f[s.length()] = { 0 }, ans = 1;
    f[0] = 1;
    for (int i = 1; i < s.length(); i++) {
        if (s[i] == '0') {
            int lst = 0;
            for (int j = 0; j < i; j++) {
                if (s[j] == '0') {
                    lst = max(lst, f[j]);
                }
            }
            f[i] = lst + 1;
        } else {
            int lst = 0;
            for (int j = 0; j < i; j++) {
                lst = max(lst, f[j]);
            }
            f[i] = lst + 1;
        }
        ans = max(ans, f[i]);
    }
    return ans;
}
signed main() {
    cin >> n >> Mod;
    int sum = 0;
    for (int i = 0; i <= (1 << n) - 1; i++) {
        string s = binary_change(i);
        sum += flcs(s);
        sum %= Mod;
    }
    int p = sum, q = (1 << n), gcd_pq = gcd(p, q);
    p /= gcd_pq, q /= gcd_pq;
    cout << (p * qpow(q, Mod - 2)) % Mod;
    return 0;
}