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

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;
  cin >> n >> m;
  vector<vector<ll>> fib = {{0, 1}};
  vector<vector<ll>> t = {{0, 1}, {1, 1}};
  vector<vector<ll>> y = mat_pow(t, n - 1, m);
  y = mat_mul(fib, y, m);
  cout << y[0][0] << endl;
  return 0;
}