import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]

    N,M = LI()

    x = [[1,1],[1,0]]
    y = [[1,0],[0,1]]
    n = N - 3

    def mul(a, b):
        z = [[0,0],[0,0]]
        for i in range(2):
            for j in range(2):
                for k in range(2):
                    z[i][j] = (z[i][j] + a[i][k] * b[k][j]) % M
        return z

    while n > 0:
        if n % 2:
            y = mul(x,y)
        x = mul(x, x)
        n //= 2

    print(sum(y[0]) % M)

if __name__ == '__main__':
    main()