#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

vvi matrix_mul(vvi A, vvi B, lint M) {
	vvi C(A.size(), vi(B[0].size()));
	rep(i, A.size()) {
		rep(k, B.size()) {
			rep(j, B[0].size()) {
				C[i][j] += A[i][k] * B[k][j];
				C[i][j] %= M;
			}
		}
	}
	return C;
}
vvi matrix_pow(vvi A, lint k, lint M) {
	vvi B(A.size(), vi(A.size()));
	rep(i, A.size()) B[i][i] = 1;
	while (k > 0) {
		if (k & (lint)1) B = matrix_mul(B, A, M);
		A = matrix_mul(A, A, M);
		k >>= 1;
	}
	return B;
}

int main() {
	lint N, M;
	cin >> N >> M;

	lint a=0, b=0, c=0, x, y, z;
	vvi v(2, vi(2));
	v[0][0] = 1, v[0][1] = 1, v[1][0] = 1;
	std::cout << matrix_pow(v, N-2, M)[0][0] << '\n';
}