/* -*- coding: utf-8 -*-
 *
 * 526.cc: No.526 フィボナッチ数列の第N項をMで割った余りを求める - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

/* subroutines */

/* main */

int main() {
  int n;
  ll m;
  cin >> n >> m;

  ll f1 = 0, f2 = 1;
  for (int i = 2; i < n; i++) {
    ll f3 = (f1 + f2) % m;
    f1 = f2, f2 = f3;
  }

  printf("%lld\n", f2);
  return 0;
}