#include <iostream>
using namespace std;
long long n, m;
long long fib(long long num) {
	long long dp[5000001]; //計算結果を入れる
	dp[0] = 0;
	dp[1] = 1;
	for (int i = 2; i <= num-1; i++) {
		dp[i] = (dp[i - 1] + dp[i - 2])%m;
	}
	return dp[num-1];
}
int main(void){
    cin >> n >> m;

    cout << fib(n)%m << endl;
    return 0;
}