#include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
#include <set>
#include <assert.h>
#include <map>
using namespace std;
typedef vector<vector<long> > dim2veclo;
typedef vector<vector<int> > dim2vecin;
typedef vector<vector<double> > dim2vecdo;
typedef vector<vector<long long> > dim2vecll;
typedef vector<int> vecin;
typedef vector<long> veclo;
typedef vector<double> vecdo;
typedef vector<long long> vecll;
typedef vector<bool> vecbo;
typedef vector<vector<bool> > dim2vecbo;
typedef long long ll;
typedef vector < pair<ll, ll> > vecpa;
typedef vector<string> vecst;
typedef pair<ll, ll> pail;
typedef pair<int, int> pain;
typedef vector<vecpa > dim2vecpa;


#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int dx[4] = { -1, 0, 1, 0 };
int dy[4] = { 0, 1, 0, -1 };


int main() {
    ll n, m; cin >> n >> m;
    if (n == 1) {
        cout << 0 % m << endl;
        return 0;
    }
    if (n == 2) {
        cout << 1 % m << endl;
        return 0;
    }
    if (n == 3) {
        cout << 1 % m << endl;
        return 0;
    }
    dim2vecll zen = dim2vecll(2, vecll(2));
    zen[0][0] = 1;
    zen[0][1] = 1;
    zen[1][0] = 1;
    zen[1][1] = 0;
    rep(i, n - 3) {
        dim2vecll neew = dim2vecll(2, vecll(2));
        neew[0][0] = zen[0][0] + zen[1][0];
        neew[0][1] = zen[0][1] + zen[1][1];
        neew[1][0] = zen[0][0];
        neew[1][1] = zen[0][1];
        neew[0][0] = neew[0][0] % m;
        neew[0][1] = neew[0][1] % m;
        neew[1][0] = neew[1][0] % m;
        neew[1][1] = neew[1][1] % m;
        zen = neew;
    }
    cout << zen[0][0] << endl;

    return 0;
}