// __builtin_popcount() ;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string st ;
typedef long double ld ;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl ;
typedef tuple<int,int,int>  ti ;
typedef tuple<ll,ll,ll> tl ;
typedef vector<vector<int>> vi ;
typedef vector<vector<ll>> vl ;
typedef vector<vector<bool>> vb ;
typedef vector<vector<st>> vs ;
typedef vector<vector<char>> vc;
const ll mod0 = 1000000007;
const ll mod1 = 998244353 ;
const ll LINF =  1000000000000000000 ;  //(10^18)
const int INF = 1000000000 ;            // (10^9)
 
 
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            x.begin(), x.end()
#define rep(i,a,n)        for (ll i = a; i <= (n); ++i)
#define re                return 0;
#define fore(i,a)         for(auto &i:a)
#define V                 vector
 
 
ll gcd(ll a, ll b){
 
   if(b == 0){
    return a;
}
return gcd(b,a%b) ;
}
 
 
ll lcm(ll a, ll b){
    
    ll ans = a*b /gcd(a,b) ;
    return ans ;
}
 
bool nis(ll q){
    
     // 素数だったらtrue ,素数じゃなかったらfalse
     
       if(q == 1){
           
           return false ;
       }
       
      for(ll i=2;i*i <=q;i++){
          if(q%i == 0){
              return false ;
          }
      }
    return true ;
}

 ll jun(ll a,ll b, ll c,ll rank ){
     
    vector<ll> ANS ;
    ANS.pb(-LINF) ;
    ANS.pb(a) ;
    ANS.pb(b) ;
    ANS.pb(c) ;
    
    sort(all(ANS)) ;
    return ANS[rank] ;
}

#define  C            cout   
#define  E            "\n";

vector<int> par;
class UnionFind {
public:
 
  
   
  // サイズをＧＥＴ！
  void init(int sz) {
       par.resize(sz,-1);
}
   // 各連結成分の一番上を返す
  int root(int x) {
    if (par[x] < 0) return x;
    return par[x] = root(par[x]);
  }
   
  // 結合作業
  bool unite(int x, int y) {
    x = root(x); y = root(y);
    if (x == y) return false;
    if (par[x] > par[y]) swap(x,y);
    par[x] += par[y];
    par[y] = x;
    return true;
  }
  // 同じグループか判定
  bool same(int x, int y) { return root(x) == root(y);}
  // グループのサイズをＧＥＴ！
  int size(int x) { return -par[root(x)];}
};
 
UnionFind UF ;
 
 
 
 st Y = "Yes" ; 
 st YY = "No" ;
 
 
vector<ll> G[1 << 18] ;

void chmin(ll& x ,ll y){x = min(x,y) ;}
void chmax(ll& x ,ll y){x = max(x,y) ;}


vector<ll> Y4 = {0,1,0,-1} ;
vector<ll> X4 = {1,0,-1,0} ;

vector<ll> Y8 = {0,1,1,1,0,-1,-1,-1} ;
vector<ll> X8 = {1,1,0,-1,-1,-1,0,1} ;


vector<ll> enumdiv(ll n) { 
    vector<ll> S;
    for (ll i = 1; i*i <= n; i++) if (n%i == 0) { S.pb(i); if (i*i != n) S.pb(n / i); }
    sort(S.begin(), S.end());
    return S;
}
 
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_priority_queue = priority_queue<T, vector<T>, less<T>> ;
//　使用例　min_priority_queue<ll (ここは型)> Q ;


ll ppow(ll a , ll b ){
    
    if(b == 0){
        return 1 ;
    }
    
    ll ans = 1 ;
    rep(i,1,b){
        ans *= a ;
        
    }
    return ans ;
}


st KU = " " ;


V<ll> prime_broken(ll a){
    
    V<ll> ans ;
    for(ll i = 2 ;i*i<=a;i++){
        if(a %i == 0){
          while(a %i == 0){
                a /= i ;
                ans.pb(i) ;
          }
            
        }
        
    }
    
    if(a != 1)ans.pb(a) ;
    return ans ;
}


const ld pai = acos(-1) ;
using P = pair<ll,ll> ;
using Edeg = tuple<ll,ll,ll> ;


 st zz = "abcdefghijklmnopqrstuvwxyz" ;
 st ZZ = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;

int main(void){ 
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// ！！入力を受け取る！！
// ！！入力を受け取る！！
// ！！入力を受け取る！！
//  UF.initはいっかいだけならいいけど、二回目以降はrepで初期化

ll N,M ;
cin>>N>>M ;

V<ll> A(N+1) ;
A[1] = 0 ;
A[2] = 1 ;
A[3] = 1 ;

A[1] %= M ;
A[2] %= M ;
A[3] %= M ;

rep(i,4,N){
    A[i] = A[i-1] + A[i-2] ;
    A[i] %= M ;
}

C << A[N] << E
 // if(dx < 0 || dy < 0 || dx >= W || dy >= H) continue ;
 // ld p  = sqrt(abs((A[i] - A[j])*(A[i] - A[j])) + abs((B[i] - B[j])*(B[i] - B[j]))) ;
 // C << fixed << setprecision(10) << 
re
}