#include <limits>
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, m;
    cin >> n >> m;
    vector<ll> v(n, 1LL);
    v[0] = 0;
    for (int i = 2; i < n; ++i) {
        (v[i] = v[i-1]+v[i-2]) %= m;
    }
    cout << v[n-1] << "\n";
    return 0;
}