def mul(A, B):
    R1 = len(A)
    C1 = len(A[0])
    C2 = len(B[0])

    res = [[0]*C2 for _ in range(R1)]
    for i in range(R1):
        for j in range(C2):
            for k in range(C1):
                res[i][j] += A[i][k] * B[k][j]
                res[i][j] %= MOD
    return res


def power(A, N):
    if N == 0:
        res = [[0]*len(A) for _ in range(len(A))]
        for i in range(len(A)):
            res[i][i] = 1
        return res

    res = power(A, N//2)
    res = mul(res, res)
    if N % 2 == 1:
        res = mul(res, A)
    return res


N, MOD = map(int, input().split())
N -= 1
if N == 0:
    ans = 0
elif N == 1:
    ans = 1
else:
    R = [[1, 1],
         [1, 0]]

    R = power(R, N-1)
    ans = mul(R, [[1], [0]])
    ans = ans[0][0]

print(ans)