#include <cmath>
#include <iostream>
using namespace std;
auto fib_mod(size_t n, size_t m) {
    size_t first = 0, second = 1, result = 1;
    for (size_t i = 2; i <= n; i++,first = second,second = result) {
        result = (first + second)%m;
    }
    return result;
}

int main(){
    size_t n,m;
    cin >> n >> m;
    cout << fib_mod(n-1,m) << '\n';
}