#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N, M;
vector<long long> dp;

void matsquare(vector<vector<long long>> &fibmat) {
    vector<vector<long long>> ret(2, vector<long long>(2));
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                ret[i][j] += fibmat[i][k] * fibmat[k][j] % M;
                ret[i][j] %= M;
            }
        }
    }
    fibmat = ret;
}

void matmul(vector<vector<long long>> &fibmat) {
    vector<long long> n(2);
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            n[i] += fibmat[i][j] * dp[j] % M;
            n[i] %= M;
        }
    }
    dp = n;
}

void matpow(int n) {
    vector<vector<long long>> fibmat(2, vector<long long>(2));
    fibmat[0][0] = 1; fibmat[0][1] = 1; fibmat[1][0] = 1;
    while (n > 0) {
        if (n & 1) {
            matmul(fibmat);
        }
        n /= 2;
        matsquare(fibmat);
    }
}

int main(void){
    cin >> N >> M;
    dp.resize(2);
    dp[0] = 0; dp[1] = 1;
    
    matpow(N-1);
    
    cout << dp[0] << endl;
}