#include <bits/stdc++.h>
using namespace std;

long long powerMod(long long a, long long b, long long mod) {
    long long res = 1;
    a %= mod;
    while (b > 0) {
        if (b & 1) res = (__int128)res * a % mod;
        a = (__int128)a * a % mod;
        b >>= 1;
    }
    return res;
}

int main() {
    long long n, p;
    cin >> n >> p;
    // sum_{k=0}^n C(n,k) = 2^n
    cout << powerMod(2, n, p) << endl;
    return 0;
}