#include #include #include using int64 = long long; int64 phi(int64 n) { int64 r = n; for (int64 i = 2; i * i <= n; ++i) { if (n % i == 0) { r = r / i * (i -1); while (n % i == 0) n /= i;; } } if (n > 1) r = r / n * (n - 1); return r; } int64 pow_mod(int64 a, int64 n, int64 mod) { int64 r = 1; for (; n; n >>= 1) { if (n & 1) r = r * a % mod; a = a * a % mod; } return r; } int64 calc(int64 n, int64 mod) { // (2 + sqrt{3}) ^ (2^n) % mod n = pow_mod(2, n, mod - 1); int64 a = 1, b = 0; int64 c = 2, d = 1; for (; n; n >>= 1) { if (n & 1) { int64 u = (a * c + 3 * b * d) % mod; int64 v = (a * d + b * c) % mod; a = u, b = v; } int64 u = (c * c + d * d * 3) % mod; int64 v = 2 * c * d % mod; c = u, d = v; } return a; } bool mark[1200000000]; int main() { int64 n, m; scanf("%lld%lld", &n, &m); if (m == 2) puts("0"); else if (n <= 1000000) { int64 x = 2; for (int i = 1; i <= n; ++i) { x = (x * x + x * 4) % m; } printf("%lld\n", x); } else if (m == 3 || pow_mod(3, m / 2, m) == m - 1) { mark[2 % m] = 1; int64 x = 2 % m, extra, target = -1, end; for (int i = 1; i <= n; ++i) { x = (x * x + 4 * x) % m; if (mark[x]) { target = x; end = i; break; } mark[x] = 1; } if (target == -1) { printf("%lld\n", x); return 0; } x = 2 % m; for (int i = 0; i < n; ++i) { if (x == target) { extra = i; break; } x = (x * x + 4 * x) % m; } //printf("%lld %lld %lld\n", extra, end, target); n -= extra; n %= (end - extra); for (int i = 0; i < n; ++i) { x = (x * x + x * 4) % m; } printf("%lld\n", x); } else { int64 r = calc(n, m) * 2 % m + m - 2; printf("%lld\n", r % m); } return 0; }