import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
#10**20に変えるのもあり
MOD = 10**9 + 7
MOD2 = 998244353
"""
from collections import defaultdict
Num = defaultdict(lambda: 0)
"""
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,M = MI()
    def dot(A, B, MOD=M):
        # 行列の積 in Z/(mod Z)*(N*N)
        N, M, L = len(A), len(A[0]), len(B[0])
        res = [[0] * L for i in range(N)]
        for i in range(N):
            for j in range(L):
                s = 0
                for k in range(M):
                    s = (s + A[i][k] * B[k][j]) % MOD
                res[i][j] = s
        return res
    def matPow(A, x, MOD=M):
        # A^x in Z/(mod Z)*(N*N)
        N = len(A)
        res = [[0] * N for i in range(N)]
        for i in range(N):
            res[i][i] = 1
        for i in range(x.bit_length()):
            if (x >> i) & 1:
                res = dot(res, A, MOD)
            A = dot(A, A, MOD)
        return res
    A = [[1,1],[1,0]]
    A = matPow(A, N-3)
    #print(A)
    Ans = A[0][0]+A[0][1]
    print(Ans % M)
    return
solve()