#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp__=boost::multiprecision;
using bint=mp__::cpp_int;
using greatd=mp__::number<mp__::cpp_dec_float<1024>>;
using namespace std;
template<class T=int> using V=vector<T>;
template<class T=int> using VV=V<V<T>>;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pli=pair<ll,int>;
using pil=pair<int,ll>;
using pdd=pair<ld,ld>;
using vi=vector<int>;
using vvi=V<vi>;
using vpi=vector<pii>;
using vvpi=V<vpi>;
using vl=vector<ll>;
using vvl=V<vl>;
using vs=vector<string>;
using vvs=V<vs>;
using vc=vector<char>;
using vvc=V<vc>;
using vd=vector<ld>;
using vvd=V<vd>;
using vpl=vector<pll>;
using vvpl=V<vpl>;
using vpil=vector<pair<int,ll>>;
using vvpil=V<vpil>;
using vpli=vector<pair<ll,int>>;
using vvpli=V<vpli>;
using vpd=vector<pdd>;
using vvpd=V<vpd>;
using vb=vector<bool>;
using vvb=V<vb>;
template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;
template<class T> using rpq=priority_queue<T,vector<T>>;
template<class T,class U>ostream &operator<<(ostream &os,const pair<T,U> &p){os <<p.first <<" " <<p.second;return os;}
template<class T,class U>istream &operator>>(istream &is,pair<T,U> &p){is >>p.first >>p.second;return is;}
#define ovl4(a,b,c,d,name,...) name
#define rep1(n) for(int i=0; i<n; ++i)
#define rep2(i,n) for(int i=0; i<n; ++i)
#define rep3(i,a,b) for(int i=a; i<b; ++i)
#define rep4(i,a,b,c) for(int i=a; i<b; i+=c)
#define rep(...) ovl4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(a) for(int i=a; i>=0; i--)
#define rrep2(i,a) for(int i=a; i>=0; i--)
#define rrep3(i,a,b) for(int i=a; i>=b; i--)
#define rrep4(i,a,b,c) for(int i=a; i>=b; i-=c)
#define rrep(...) ovl4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define atrep(i,v) for(auto i:v)
void in(){}
template<class... T>void in(T&... a){(cin >>... >>a);}
template<class T>
void vin(vector<T> &v,int n=-1,int s=0){if(n==-1)n=v.size();rep(i,s,s+n)in(v[i]);}
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
void VIN(){}
template<class T,class... Ts>
void VIN(int ind,vector<T>& v,Ts&... vs){vin<T>(v,v.size()-ind,ind);if constexpr(sizeof...(vs)>0)VIN(ind,vs...);}
template<class T,class... Ts>
bool chmax(T &a,Ts... b){T c=a;for(auto i:{b...})a=max(a,i);return a==c;}
template<class T,class...Ts>
bool chmin(T &a,Ts... b){T c=a;for(auto i:{b...})a=min(a,i);return a==c;}
template<class T,class... Ts>
bool chcomp(function<T(T,T)> comp,T &a,Ts... b){T c=a;for(auto i:{b...})a=comp(a,i);return a==c;}
void print(){cout<<"\n";}
template<class T,class... Ts>
void print(const T &a,const Ts&... b){cout <<a;(cout<<... <<(cout<<" ",b));cout<<"\n";}
template<class T>
void vprint(vector<T> &v,bool ind1=false,string aid=" "){rep(i,(int)ind1,v.size()){if(i>(int)ind1){cout <<aid;}cout <<v[i];}print();}
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Sort(a) sort(all(a))
#define rsort(a) sort(rall(a))
#define Uniq(a) a.erase(unique(all(a)),a.end())
#define Rvs(a) reverse(all(a))
#define pb push_back
#define eb emplace_back
#define elif else if
#define cY cout <<"Yes\n"
#define cN cout <<"No\n"
void yn(bool b){if(b){cY;}else{cN;}}
void YN(bool b){if(b)cout <<"YES\n";else cout <<"NO\n";}
#define ft first
#define sd second
#define inr(l,x,r) (l<=x && x<=r)
#define hinr(l,x,r) (l<=x && x<r)
#define ingrid(i,a,b,h,w) (inr(i,a,h+i-1) && inr(i,b,w+i-1))
#define FIX cout <<fixed <<setprecision(15)
template<class T>
bool eql(const T &a){return true;};
template<class T,class... Ts>
bool eql(const T& a,const Ts&... b){bool ret=true;for(auto i:{b...})ret&=(i==a);return ret;}
bool operator==(const string& a,const string& b){return a.compare(b)==0;}
random_device rd;
mt19937 mt(rd());
const int INF=1e9;
const ll LINF=1e18;
const ll MOD=1e9+7;
const ll MMOD=998244353;
const ld eps=1e-10;
const ld PI=M_PI;
bool deql(const ld &a){return true;}
template<typename... Args>
bool deql(const ld& a,const Args&... b){bool ret=true;for(auto i:{b...})ret&=(inr(-eps,i-a,eps));return ret;}
int dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
class xorshift{
    private:uint64_t x;
    public:
    xorshift(){mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());x=rnd();for(int i=0; i<100; i++)random();}
    uint64_t random(){x=x^(x<<7);return x=x^(x>>9);}
};xorshift rnd;

vector<vector<long long>> matpow(vector<vector<long long>> &mat,int n,long long m=1e18){
	int len=mat.size();
	vector<vector<long long>> ret(len,vector<long long>(len)),a=mat;
	for(int i=0; i<len; ++i)ret[i][i]=1;
	while(n>0){
		if(n&1){
			vector<vector<long long>> p(len,vector<long long>(len));
			for(int i=0; i<len; ++i)for(int j=0; j<len; ++j){
				long long sum=0;
				for(int k=0; k<len; ++k)sum=((sum+(ret[i][k]*a[k][j])%m)+m)%m;
				p[i][j]=sum;
			}
			ret=p;
		}
		vector<vector<long long>> p(len,vector<long long>(len));
		for(int i=0; i<len; ++i)for(int j=0; j<len; ++j){
			long long sum=0;
			for(int k=0; k<len; ++k)sum=((sum+(a[i][k]*a[k][j])%m)+m)%m;
			p[i][j]=sum;
		}
		a=p;
		n>>=1;
	}
	return ret;
}
int main(){
    ios::sync_with_stdio(false);std::cin.tie(nullptr);cout.tie(nullptr);FIX;
    INT(n);
    LL(m);
    vvl f(2,vl(2,1));
    f[1][1]=0;
    f=matpow(f,n-2,m);
    print(f[0][0]);
    return 0;
}