#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) {
	fib[0] = 0;
	fib[1] = 1;
	for (int i = 2; i <= n; i++) {
		fib[i] = (fib[i - 1] + fib[i - 2])%M;
	}
	return fib[n];
}

int main()
{
	cin >> N >> M;
	for (int i = 0; i < N; i++)
		fib[i] = -1;
	fib[0] = 0;
	fib[1] = 1;

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