#include <cstdio>
int n, m;
struct Matrix {
int a[3][3];
Matrix operator*(const Matrix &b) {
Matrix res{};
for (int i = 1; i <= 2; i ++)
for (int j = 1; j <= 2; j ++)
for (int k = 1; k <= 2; k ++)
res.a[i][j] = (res.a[i][j] + 1LL * a[i][k] * b.a[k][j] % m) % m;
return res;
}
} ans, base;
int main() {
scanf("%d %d", &n, &m);
base.a[1][1] = base.a[1][2] = base.a[2][1] = 1, base.a[2][2] = 0;
ans.a[1][1] = ans.a[1][2] = 1;
int b = n + 1;
while (b) {
if (b & 1)
ans = ans * base;
base = base * base;
b >>= 1;
}
int ques = (1LL * n * ans.a[1][2] % m - ans.a[1][1] + 2) % m;
ques = (ques + m) % m;
printf("%d", ques);
return 0;
}