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

#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>

#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>

constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
//constexpr ll mod = 998244353;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void pt(T val) {
    cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v) {
    ll vs = v.size();
    rep(i, vs) {
        cout << v[i];

        if (i == vs - 1)
            cout << "\n";
        else
            cout << " ";
    }
}
ll mypow(ll a, ll n) {
    ll ret = 1;
    if(n==0) return 1;
    if(a==0) return 0;
    rep(i, n) {
        if (ret > (ll)(1e18 + 10) / a) return -1;
        ret *= a;
    }
    return ret;
}
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
vector<vector<ll>> mat_mul(vector<vector<ll>> a, vector<vector<ll>> b, ll m)
{
    vector<vector<ll>> c(a.size(), vector<ll>(b[0].size(), 0));
    for (int i = 0; i < a.size(); i++){
        for (int k = 0; k < b[0].size(); k++){
            for (int j = 0; j < b.size(); j++){
                c[i][k] = (c[i][k] + (a[i][j] * b[j][k]) % m) % m;
            }
        }
    }
    return c;
}

vector<vector<ll>> mat_pow(vector<vector<ll>> x, ll n, ll m)
{
    vector<vector<ll>> y(x.size(), vector<ll>(x.size(), 0));
    for (int i = 0; i < x.size(); i++){
        y[i][i] = 1;
        while (n){
            if (n & 1){
                    y = mat_mul(x, y, m);
            }
            x = mat_mul(x, x, m);
            n >>= 1;
        }
    }
    return y;
}
int main() {
    ll n,m,ans=0;
    cin>>n>>m;
    vvll p(2,vll(1));
    vvll a(2,vll(2));
  	p[0][0]=1;
    a[0][0]=1;
    a[0][1]=1;
    a[1][0]=1;
    a=mat_pow(a,n-2,m);
    p=mat_mul(a,p,m);
    ans=p[0][0];
    cout<<ans<<endl;
}