#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//okita
int main(){
   ll N,M;cin>>N>>M;
   vector<ll> F(N);
   F[0]=0;
   F[1]=1;
   for(ll i=2;i<N;i++){
       F[i]=(F[i-1]%M)+(F[i-2]%M);
       F[i]=F[i]%M;
   }
   cout<<F[N-1]%M<<endl;
}