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

vector<vector<long long>> f(vector<vector<long long>> A, vector<vector<long long>> B, long long mod){
    vector<vector<long long>> C(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++){
                C.at(i).at(j) += A.at(i).at(k) * B.at(k).at(j);
                C.at(i).at(j) %= mod;
            }
        }
    }
    return C;
}

vector<vector<long long>> modpow(vector<vector<long long>> A, long long n, long long mod){
    vector<vector<long long>> ret={{1,0},{0,1}};
    while(n > 0){
        if(n & 1) ret = f(ret,A,mod);
        A = f(A,A,mod);
        n >>= 1;
    }
    return ret;
}

int main(){
    long long N,M;
    cin >> N >> M;
    vector<vector<long long>> A = {{1,1},{1,2}};
    vector<vector<long long>> ans = modpow(A,(N-1)/2,M);
    cout << ans.at((N+1)%2).at(1) << endl;
    return 0;
}