#include <cassert>
#include <cstdio>
using ll = long long;

int fib(ll n, int mod) {
    assert (n >= 0);
    if (n <= 1) return n;
    int a = 0;
    int b = 1;
    ll i = 1ll << (63 - __builtin_clzll(n) - 1);
    for (; i; i >>= 1) {
        int na = (a *(ll) a + b *(ll) b) % mod;
        ll nb = 2ll * a + b;
        if (nb >= mod) nb -= mod;
        nb = nb * b % mod;
        a = na;
        b = nb;
        if (n & i) {
            ll c = a +(ll) b; if (c >= mod) c -= mod;
            a = b;
            b = c;
        }
    }
    return b;
}

int main() {
    int n, m; scanf("%d%d", &n, &m);
    printf("%d\n", fib(n - 1, m));
    return 0;
}