#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
ll jc[1000006];
ll jy[1000006];
ll pw(ll a,ll b,ll m)
{
	ll r=1;
	while(b)
	{
		if(b&1) r=r*a%m;
		a=a*a%m;
		b>>=1;
	}
	return r;
}
ll sol(ll a,ll m)
{
	ll rt=0;
	for(int i=0;i*2<=a;i++) rt+=jc[a]*jy[i]%m*jy[i]%m*jy[a-i*2]%m;
	return rt%m;
}
int main()
{
	ios_base::sync_with_stdio(0);
	ll n;
	ll m;
	cin>>n>>m;
	jc[0]=1;
	for(int i=1;i<m;i++) jc[i]=jc[i-1]*i%m;
	jy[m-1]=m-1;
	for(int i=m-2;i>=0;i--) jy[i]=jy[i+1]*(i+1)%m;
	ll ans=1;
	ll gp=pw(3,n,m),hf=(m+1)/2;
	while(n) ans=ans*sol(n%m,m)%m,n/=m;
	cout<<(gp+m-ans)*hf%m<<endl;
	return 0;
}