#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

ll N, M;
ll fib[5000010];

ll f(ll n) {
	if (n == 0) return 0;
	if (n == 1)return 1;
	if (fib[n] != 0)
		return fib[n];

	return fib[n] = f(n - 1) + f(n - 2);
}

int main()
{
	cin >> N >> M;
	fib[0] = 0;
	fib[1] = 1;

	cout << f(N-1)%M << endl;
	return	0;
}