#include<bits//stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll n, m;
mat mul(mat& a, mat& b) {
	mat c(a.size(), vec(b[0].size(),0));
	rep(i, a.size()) {
		rep(k, b.size()) {
			rep(j, b[0].size()) {
				c[i][j] =(c[i][j] + a[i][k] * b[k][j])% m;
			}
		}
	}
	return c;
}
mat mpow(mat a, ll n) {
	mat b(a.size(), vec(a.size(),0));
	rep(i, a.size()) b[i][i] = 1;
	while (n > 0) {
		if (n & 1) b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}return b;
}
int main() {
	cin >> n >> m;
	mat a = { {1,1},{1,0} };
	a = mpow(a, n - 1);
	cout << a[1][0] << endl;
}