#include <bits/stdc++.h>
using namespace std;
random_device seed_gen;mt19937 rnd(seed_gen());

using ll = long long;using ull = unsigned long long;
using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;
using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;
template<typename T>inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T>inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }
bool eq(double a, double b) { return abs(a - b) < 0.0000001; }
const int di4[4] = { 0,-1,0,1 },dj4[4] = { -1,0,1,0 };//LRUD
const int di8[8] = { 0,0,1,1,1,-1,-1,-1 },dj8[8] = { 1,-1,0,-1,1,0,-1,1 };

#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define Rrep(i,n) for(int i=n-1;i>=0;i--)
#define Rrep1(i,n) for(int i=n;i>0;i--)
#define all(a) a.begin(),a.end()
#define yesno(ans) cout<<((ans)?"Yes\n":"No\n")
#define YESNO(ans) cout<<((ans)?"YES\n":"NO\n")
#define INF ((ll)2e18)
#define IINF ((int)(1e9+5e8))
const double PI = 3.1415926535897932384626;
#define eb emplace_back
#define pb push_back

///*ACL
#include<atcoder/modint>
using namespace atcoder;
using mint=modint;
//using mint = modint998244353;
//using mint = modint1000000007;
using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;
//*/

//行列累乗
//行列の要素の型は最初、int型になっています.
using matrixElementType=mint;//行列の要素の型
//行列累乗を行う行列は正方行列.

using vec=vector<matrixElementType>;
using mat=vector<vec>;

mat mul(const mat&A,const mat&B){
    assert(int(A[0].size())==int(B.size()));

    mat C(int(A.size()),vec(int(B[0].size())));
    for(int i=0;i<int(A.size());i++){
        for(int j=0;j<int(B[0].size());j++){
            for(int k=0;k<int(A[0].size());k++){
                C[i][j]+=A[i][k]*B[k][j];
            }
        }
    }
    return C;
}

mat pow(mat A,ll n){
    mat B(int(A.size()),vec(int(A.size())));
    for(int i=0;i<int(A.size());i++){
        B[i][i]=1;
    }
    while(n>0){
        if(n&1)B=mul(B,A);
        A=mul(A,A);
        n>>=1LL;
    }
    return B;
}

int solve() {
    ll N;cin>>N;
    int M;cin>>M;
    modint::set_mod(M);
    mat A(2,vec(2));
    A[0][0]=1,A[0][1]=1;
    A[1][0]=1,A[1][1]=0;
    A=pow(A,N-1);
    mat F(2,vec(1));
    F[0][0]=1;
    F[1][0]=0;
    F=mul(A,F);
    cout<<F[1][0].val()<<"\n";
    return 0;
}

int main(){
    int T=1;
    //cin>>T;
    while (T--){
        solve();
    }
    return 0;
}