#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

ll N, m;


ll memo[5000010];
ll fib( ll n){


	if(n ==1){
		return 0;
	}
	if(n ==2){
		return 1;
	}

	if(memo[n]){
		return memo[n];
	}

	memo[n] = (fib(n-1)+fib(n-2))%m;

	return memo[n];
}
int main() {

	cin>>N>>m;


	cout<<fib(N)<<endl;

return 0;

}