#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int N;
    cin >> N;
    ll M;
    cin >> M;
    vector A(vector(2, vector(2, 0LL)));
    vector B(vector(2, vector(2, 0LL)));
    A = {{1LL, 1LL}, {1LL, 0LL}};
    B = {{1LL, 0LL}, {0LL, 1LL}};
    auto Apow = [&] (int n) {
        while(0 < n) {
            if(n & 1) {
                vector C(vector(2, vector(2, 0LL)));
                C  = {{1LL, 0LL}, {0LL, 1LL}};
                for(int i = 0; i < 2; i++) {
                    for(int j = 0; j < 2; j++) {
                        C[i][j] = (A[i][0] * B[0][j] + A[i][1] * B[1][j]) % M;
                    }
                }
                B = C;
            }
            vector D(vector(2, vector(2, 0LL)));
            for(int i = 0; i < 2; i++) {
                for(int j = 0; j < 2; j++) {
                    D[i][j] = (A[i][0] * A[0][j] + A[i][1] * A[1][j]) % M;
                }
            }
            A = D;
            n >>= 1;
        }
    };
    Apow(N-2);
    ll ans(B[0][0]);
    cout << ans << endl;
    return 0;
}