#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll I=167167167167;
ll Q=1e9+7;
ll M,N;
vector<vector<ll>> mul(vector<vector<ll>> a,vector<vector<ll>> b){
	vector<vector<ll>> c={{0,0},{0,0}};
	for(int i=0;i<2;i++){
		for(int k=0;k<2;k++){
			for(int j=0;j<2;j++){

					c[i][k]+=a[i][j]*b[j][k];
				
			}
			c[i][k]%=M;
		}
	}
	return c;
}
vector<vector<ll>> jyo(vector<vector<ll>> a,ll b){
	vector<vector<ll>> e={{1,0},{0,1}};
	while(b>0){
		if(b%2==1){
			e=mul(e,a);
		}
		a=mul(a,a);
		b/=2;
	}
	return e;
}
int main() {
	cin>>N>>M;
	vector<vector<ll>> p={{1,1},{1,0}};
	p=jyo(p,N-1);
	cout<<p[1][0]<<endl;
}