#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using pll = pair<ll, ll>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using pdd = pair<double, double>; using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using pbb = pair<bool, bool>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using pss = pair<string, string>; using vs = vector<string>; using vvs = vector<vs>; using vvvs = vector<vvs>;
#define repeat(counter, start, goal, step) for (int counter = (int)(start); counter < (int)(goal); counter += step)
#define rep(counter, times) repeat(counter, 0, times, 1)
#define rep2(counter, start, goal) repeat(counter, start, goal, 1)
#define rep0(times) repeat(counter, 0, times, 1)
#define rrepeat(counter, start, goal, step) for (int counter = (int)(start); counter > (int)(goal); counter -= step)
#define rep3(counter, start, goal) rrepeat(counter, start, goal, 1)
#define rrep(counter, start, goal) rrepeat(counter, start - 1, goal - 1, 1)
#define all(container) begin(container), end(container)
template <typename T> bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; }
template <typename T> bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; }
void yn(bool flag) { cout << (flag ? "yes" : "no") << "\n"; }
void Yn(bool flag) { cout << (flag ? "Yes" : "No") << "\n"; }
void YN(bool flag) { cout << (flag ? "YES" : "NO") << "\n"; }
void set_prec(const int &digits) { cout << fixed << setprecision(digits); cerr << fixed << setprecision(digits); }
template <typename T> void pr(const T &obj) { cerr << obj; }
template <typename T, typename ...Ts> void pr(const T &first, const Ts &...rest) { pr(first); pr(", "); pr(rest...); }
template <typename S, typename T> void pr(const pair<S, T> &pair) { pr("("); pr(pair.first); pr(", "); pr(pair.second); pr(")"); }
template <typename T> void pr(const vector<T> &vec) { pr("{"); for (T obj : vec) { pr(obj); pr(", "); } pr("}"); }
template <typename T> void pr(const vector<vector<T>> &vv) { pr("\n"); rep(index, vv.size()) { pr("["); pr(index); pr("]: "); pr(vv[index]); pr("\n"); } }
template <typename T> void pr(const set<T> &vec) { pr("{"); for (T obj : vec) { pr(obj); pr(", "); } pr("}"); }
template <typename S, typename T> void pr(const map<S, T> &map) { pr("{"); for (pair<S, T> pair : map) { pr("("); pr(pair.first); pr(": "); pr(pair.second); pr("), "); } pr("}"); }
#define db(obj) cerr << #obj << ": "; pr(obj); cerr << " "
#define dl(obj) db(obj); cerr << "\n";
#define dm(...) cerr << "(" << #__VA_ARGS__ << "): ("; pr(__VA_ARGS__); cerr << ") "
#define dml(...) dm(__VA_ARGS__); cerr << "\n"
// #include <atcoder/all>
// using namespace atcoder;
// const ll MOD = 1000000007;
// const ll MOD = 998244353;
ll M;
template <typename T> T zero() { return 0; } // 加法の単位元
template <typename T> T one() { return 1; } // 乗法の単位元(零元)
template <typename T> T sum(T x, T y) { return (x + y) % M; } // 加法
template <typename T> T neg(T x) { return (-x + M) % M; } // 加法の逆元
template <typename T> T prod(T x, T y) { return x * y % M; } // 乗法
template <typename T> // 乗法の逆元
T inv(T x) {
	assert(x != zero<T>());
	return 1 / x;
}
// 行列
template <typename T>
struct Matrix {
	int row, col;
	vector<vector<T>> a;
	Matrix(const int &_row, const int &_col) {
		assert(_row > 0); assert(_col > 0);
		row = _row; col = _col;
		a = vector<vector<T>>(row, vector<T>(col, zero<T>()));
	}
	Matrix(const int &_n) : Matrix(_n, _n) {}
	Matrix(const vector<vector<T>> &_a) : Matrix(_a.size(), _a[0].size()) {
		a = _a;
	}
	// 加法の逆行列
	Matrix operator-() const {
		Matrix res = this;
		for (int i = 0; i < res.row; ++i) {
			for (int j = 0; j < res.col; ++j) {
				res.a[i][j] = neg<T>(a[i][j]);
			}
		}
		return res;
	}
	// debug
	void show() {
		for (int i = 0; i < row; ++i) {
			cout << "(";
			for (int j = 0; j < col; ++j) {
				cout << a[i][j];
				if (j < col - 1) cout << ", ";
			}
			cout << ")\n";
		}
		cout << "\n";
	}
};
// 零行列(加法の単位行列)
template <typename T> Matrix<T> zero(const int &m, const int &n) { return new Matrix<T>(m, n); }
template <typename T> Matrix<T> zero(const int &n) { return zero<T>(n, n); }
// 単位行列
template <typename T>
Matrix<T> one(const int &m, const int &n) {
	Matrix<T> res = Matrix<T>(m, n);
	for (int i = 0; i < min(m, n); ++i) {
		res.a[i][i] = one<T>();
	}
	return res;
}
template <typename T> Matrix<T> one(const int &n) { return one<T>(n, n); }
// 行列のスカラー倍
template <typename T>
Matrix<T> operator*(const T &k, const Matrix<T> &A) {
	Matrix<T> res = A;
	for (int i = 0; i < res.row; ++i) {
		for (int j = 0; j < res.col; ++j) {
			res.a[i][j] = prod(res.a[i][j], k);
		}
	}
	return res;
}
template <typename T> Matrix<T> operator*(const Matrix<T> &A, const T &k) { return k * A; }
template <typename T> void operator*=(Matrix<T> &A, const T &k) { A = A * k; }
// 行列の加法・減法
template <typename T>
Matrix<T> operator+(const Matrix<T> &A, const Matrix<T> &B) {
	assert(A.row == B.row); assert(A.col == B.col);
	Matrix<T> res = Matrix<T>(A.row, A.col);
	for (int i = 0; i < res.row; ++i) {
		for (int j = 0; j < res.col; ++j) {
			res.a[i][j] = sum(A.a[i][j], B.a[i][j]);
		}
	}
	return res;
}
template <typename T> void operator+=(Matrix<T> &A, const Matrix<T> &B) { A = A + B; }
template <typename T> Matrix<T> operator-(const Matrix<T> &A, const Matrix<T> &B) { return A + (-B); }
template <typename T> void operator-=(Matrix<T> &A, const Matrix<T> &B) { A = A - B; }
// 行列の乗法
template <typename T>
Matrix<T> operator*(const Matrix<T> &A, const Matrix<T> &B) {
	assert(A.col == B.row);
	Matrix<T> res = Matrix<T>(A.row, B.col);
	for (int i = 0; i < res.row; ++i) {
		for (int j = 0; j < res.col; ++j) {
			for (int k = 0; k < A.col; ++k) {
				res.a[i][j] = sum(res.a[i][j], prod(A.a[i][k], B.a[k][j]));
			}
		}
	}
	return res;
}
template <typename T> void operator*=(Matrix<T> &A, const Matrix<T> &B) { A = A * B; }
// 行列累乗
template <typename T>
Matrix<T> pow(const Matrix<T> &A, long long d) {
	assert(A.row == A.col);
	assert(d >= 0);
	Matrix<T> res = one<T>(A.row), X = A;
	while (d > 0) {
		if (d & 1) res *= X;
		X *= X;
		d >>= 1;
	}
	return res;
}
// mintのMatrixのdebug
// void show(const Matrix<mint> &A) {
// 	for (int i = 0; i < A.row; ++i) {
// 		cout << "(";
// 		for (int j = 0; j < A.col; ++j) {
// 			cout << A.a[i][j].val();
// 			if (j < A.col - 1) cout << ", ";
// 		}
// 		cout << ")\n";
// 	}
// 	cout << "\n";
// }
// debug
template <typename T>
void show(const Matrix<T> &A) {
	for (int i = 0; i < A.row; ++i) {
		cout << "(";
		for (int j = 0; j < A.col; ++j) {
			cout << A.a[i][j];
			if (j < A.col - 1) cout << ", ";
		}
		cout << ")\n";
	}
	cout << "\n";
}
int main() {
	int N; cin >> N >> M;
		Matrix<ll> A{{{1, 1}, {1, 0}}}, x{{{1}, {0}}};
	Matrix<ll> ans = pow(A, N - 1) * x;
	cout << ans.a[1][0] << endl;
}