//q109.cpp
//Sat Feb 13 11:22:24 2021

#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)

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

int main(){
	ll n,m;
	cin >> n >> m;

	vector<ll> fib(2);
	vector<vector<ll>> mt(2,vector<ll>(2));

	fib[0] = 0; fib[1] = 1;
	mt[0][0] = mt[0][1] = mt[1][0] = 1;
	mt[1][1] = 0;

	while (n){
		if (n&1){
			vector<ll> nfib(2);
			rep(i,2){
				nfib[i] = (mt[i][0]*fib[0]%m+mt[i][1]*fib[1]%m)%m;
			}
			rep(i,2)fib[i] = nfib[i];
		}
		vector<vector<ll>> nmt(2,vector<ll>(2));
		rep(i,2)rep(j,2){
			nmt[i][j] = 0;
			rep(k,2){
				nmt[i][j] += mt[i][k]*mt[k][j]%m;
				nmt[i][j] %= m;
			}
		}
		rep(i,2)rep(j,2)mt[i][j] = nmt[i][j];
		n = n/2;
	}

	cout << fib[1] << endl;
//	printf("%.4f\n",ans);
}