#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <bitset>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
#define fore(i, a) for(auto& i : a)
#define pi 3.141592653589793238
typedef long long ll;
ll mod = 998244353; ll mof = 1000000007;

ll n, m;

tuple<ll, ll, ll, ll>kake(tuple<ll, ll, ll, ll>a, tuple<ll, ll, ll, ll>b) {
	ll a0 = get<0>(a);
	ll a1 = get<1>(a);
	ll a2 = get<2>(a);
	ll a3 = get<3>(a);
	ll b0 = get<0>(b);
	ll b1 = get<1>(b);
	ll b2 = get<2>(b);
	ll b3 = get<3>(b);
	ll c0 = a0 * b0 + a1 * b2;
	ll c1 = a0 * b1 + a1 * b3;
	ll c2 = a2 * b0 + a3 * b2;
	ll c3 = a2 * b1 + a3 * b3;
	return make_tuple(c0 % m, c1 % m, c2 % m, c3 % m);
}

int main()
{
	cin >> n >> m;
	tuple<ll, ll, ll, ll>a[39];
	a[0] = make_tuple(0, 1, 1, 1);
	rep(i, 1, 31) {
		a[i] = kake(a[i - 1], a[i - 1]);
	}
	bitset<30>bs(n-1);
	tuple<ll, ll, ll, ll>ans = make_tuple(1, 0, 0, 1);
	rep(i, 0, 30) {
		if (bs[i])ans = kake(ans, a[i]);
	}
	cout << get<1>(ans) << endl;
}