#include <bits/stdc++.h>
#include<random>
#include<chrono>
using namespace std;

#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()
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>;
#define INF ((ll)2e18)
#define IINF ((int)(1e9+5e8))
const double PI = 3.1415926535897932384626433832795028841971;
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)); }
#define yesno(ans) cout<<((ans)?"Yes\n":"No\n")
bool eq(double a, double b) { return abs(a - b) < 0.0000001; }
//LRUD
//const int di[4] = { 0,-1,0,1 };
//const int dj[4] = { -1,0,1,0 };
const int di[8] = { 0,0,1,1,1,-1,-1,-1 };
const int dj[8] = { 1,-1,0,-1,1,0,-1,1 };

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

random_device seed_gen;
mt19937 rnd(seed_gen());

using vec=vm;
using mat=vvm;

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

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

int solve() {
    ll N,M;cin>>N>>M;
    mint::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);
    cout<<A[0][1].val()<<"\n";
    return 0;
}

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