#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;

void prework(){

}

void read(){

}

ll n, P;
ll MAGIC0, MAGIC1;

void precalc(){
    __int128 x = (((__int128)1)<<63) - (((__int128)1)<<63)%P - 1,t;
    for(MAGIC1=0;t=((__int128)1)<<MAGIC1,t<=x*(P-t%P);MAGIC1++);
    if(MAGIC1 < 64) MAGIC1 = 64, t = ((__int128)1)<<64;
    MAGIC0 = (t+P-t%P)/P;
}

long long mod(long long x){
    long long t = ((__int128)x) * MAGIC0 >> 64;
    if (MAGIC0 < 0) t += x;
    return x - (t >> (MAGIC1 - 64)) * P;
}

int f[70000000];

void solve(int casi){
//	cout << "Case #" << casi << ": ";
	cin >> n >> P;
	
	//n=1000000000000000000ll,P=1000000007ll;
	
	if (P == 2){
		cout << 0 << endl;
		return ;
	}
	//f[0] = 1;
	ll x = 2;
	precalc();
	ll T, G, U;
	int flag = 0;
	n++;
	if (P < 70000000){
		for (int i = 2; i <= n; i++){
			x = mod(x * (x + 4));
			if (f[x]){
				flag = 1;
				T = (i - f[x]);
				G = f[x];
				U = x;
				break;
			}
			else{
				f[x] = i;
			}
		}
	}
	else{
		for (int i = 2; i <= n; i++){
			x = mod(x * (x + 4));
			//cerr << x << ' ' << (x >> 4) <<endl;
			if ((x & 15)==0){
				if (f[x >> 4]){
					flag = 1;
					T = (i - f[x >> 4]);
					G = f[x >> 4];
					U = x;
					break;
				}
				else{
					f[x >> 4] = i;
				}
			}
		}
	}
	//cout << T << endl;
	//cout << flag << ' ' << T << ' ' << G << ' ' << U << endl;
	if (flag){
		x = U;
		ll i = (n - G) % T;
		for (; i; i--){
			x = mod(x * (x + 4));
		}
		cout << x << endl;
	}
	else{
		cout << x << endl;
	}
}

void printans(){

}


int main(){
	std::ios::sync_with_stdio(false);
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}