#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
constexpr int MD = 1000000007;
constexpr int INF = INT_MAX;
constexpr long long LINF = LLONG_MAX;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;using vi = vector<int>;using vll = vector<ll>;
template <class T>
using ps = pair<T, T>;
template <class T>
using vec = vector<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;  // ascendent

template <typename T>
int sz(const T& x) { return x.size(); }

// a = min(a,b)
template <typename T, typename S>
inline bool chmin(T& a, const S& b) {
  return (a > b ? a = b, 1 : 0);
}
template <typename T, typename S>
inline bool chmax(T& a, const S& b) {
  return (a < b ? a = b, 1 : 0);
}

ll mpow(int base, int exponent, int mod){
    if(exponent == 0) return 1;
    ll c = mpow(base, exponent/2, mod);
    c *= c;
    c %= mod;
    if(exponent % 2 == 1){
        c *= base;
        c %= mod;
    }
    return c;
}

/* 
auto push = [&](int r, int c){
    if(r < 0 || c < 0 || r >= h || c >= w) return;
    if(dist[r][c] != -1) return;
};
*/ //dfs/bfs埋め込み用

/*
class edge{
public:
    int to, weight;
    edge(int a, int b){
        to = a; weight = b;
    }
};
*/ //template of edge
/*class edge2{
public:
    int from, to, weight;
    edge2(int w, int a, int b){
        from = w; to = a; weight = b;
    }
};
bool comp(edge2 a, edge2 b){
    return a.weight < b.weight;
}
*/ //template of edge2
struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(20) << fixed;
#define endl "\n"
  }
} before_main_function;
int main(int /*argc*/, char** /*argv*/){
  int n, m;
  cin >> n >> m;
  n--;
  vec<ll> farr(4, 1);
  farr[3] = 0;
  vec<ll> ans = {1, 0, 0, 1};
  while(n){
    if(n&1){
      //ans * farr
      int p = ((ans[0]*farr[0])%m+(ans[1]*farr[2])%m)%m;
      int q = ((ans[0]*farr[1])%m+(ans[1]*farr[3])%m)%m;
      int r = (ans[2]*farr[0]%m+(ans[3]*farr[2])%m)%m;
      int s = (ans[2]*farr[1]%m+ans[3]*farr[3]%m)%m;
      ans[0] = p;
      ans[1] = q;
      ans[2] = r;
      ans[3] = s;
    }
    // farr * farr
    int p = (farr[0]*farr[0]%m+farr[1]*farr[2]%m)%m;
    int q = (farr[0]*farr[1]%m+farr[1]*farr[3]%m)%m;
    int r = (farr[2]*farr[0]%m+farr[3]*farr[2]%m)%m;
    int s = (farr[2]*farr[1]%m+farr[3]*farr[3]%m)%m;
    farr[0] = p;
    farr[1] = q;
    farr[2] = r;
    farr[3] = s;
    n >>= 1;
  }
  cout << ans[2] << endl;
  return 0;
}