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

ll M;

vector<vector<ll>> mul(vector<vector<ll>> vec, vector<vector<ll>> vec2){
        if(vec.size()!=vec2[0].size())return {};
        vector<vector<ll>> vec3;
        vec3.resize(vec2.size());
        for(int i = 0 ; i < vec[0].size() ; i++){
                for(int j = 0 ; j < vec2.size() ; j++){
                        vec3[j].resize(vec[0].size());
                        ll ans = 0;
                        for(int k = 0 ; k < vec.size() ; k++){
                                ans += vec[k][i]*vec2[j][k];
                                ans %= M;
                        }
                        vec3[j][i] = ans;
                }
        }

        return vec3;
}
vector<vector<ll>> add(vector<vector<ll>> vec, vector<vector<ll>> vec2){
        if(vec.size()!=vec2.size())return {};
        if(vec[0].size()!=vec2[0].size())return {};
        vector<vector<ll>> vec3;
        vec3.resize(vec.size());
        for(int i = 0 ; i < vec.size() ; i++){
                vec3[i].resize(vec[0].size());
                for(int j = 0 ; j < vec[0].size() ; j++){
                        vec3[i][j] = vec[i][j]+vec2[i][j];
                        vec3[i][j] %= M;
                }
        }
        return vec3;
}  

int main(){
        ll N;
        cin >> N >> M;
        vector<vector<ll>> pow = {{0,1},{1,1}};
        vector<vector<ll>> ans = {{0},{1}};
        N--;
        for(int i = 0 ; i <= 60 ; i++){
                if(N>>i & 1){
                        ans = mul(ans,pow);
                }
                pow = mul(pow,pow);
        }
        cout << ans[0][0] << endl;
}