#include <iostream>
#include <cassert>
#include <cstdint>
#include <vector>
using namespace std;

class Fibonacci final {
public:
    static int get_remainder(int64_t n, int m) {
        assert(n >= 1);
        assert(m >= 2);
        vector <unsigned long long> pisano;
        int a = 0, b = 1;
        pisano.push_back(0);
        pisano.push_back(1);
        for (int i = 2; i <= n; i++) {
            unsigned long long current_fib_number_remainder = (a + b) % m;
            a = b;
            b = current_fib_number_remainder;
            pisano.push_back(current_fib_number_remainder);
            if (a == 0 && b == 1) {
                pisano.pop_back();
                pisano.pop_back();
                break;
            }
        }
        return (unsigned long long)pisano[n % pisano.size()];
    }
};

int main() {
    int64_t n;
    int m;
    std::cin >> n >> m;
    std::cout << Fibonacci::get_remainder(n, m) << std::endl;
    return 0;
}