def matmul(A, B, MOD):   # A,B: 行列
    res = [[0] * len(B[0]) for _ in [None] * len(A)]
    for i, resi in enumerate(res):
        for k, aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                resi[j] += aik * bkj
                resi[j] %= MOD
    return res

def matpow(A, p, mod):   # A^p を mod で割った余り
    if p % 2:
        return matmul(A, matpow(A, p-1, mod), mod)
    elif p > 0:
        b = matpow(A, p//2 ,mod)
        return matmul(b, b, mod)
    else:
        return [[int(i==j) for j in range(len(A))] for i in range(len(A))]


N, M = map(int, input().split())
S = [[1], [0]]
mat = [[1, 1], [1, 0]]
T = matpow(mat, N - 2, M)
print(matmul(T, S, M)[0][0])