n,mod=map(int,input().split())
def mat_mul(x,y):
    want=[[0 for i in range(len(y[0]))] for j in range(len(x))]
    for i in range(len(x)):
        for j in range(len(y[0])):
            for k in range(len(y)):
                want[i][j]+=x[i][k]*y[k][j]
            want[i][j]%mod
    return want
def mat_pow(x,n):
    p=[[0]*len(x) for i in range(len(x))]
    for i in range(len(x)):
        p[i][i]=1
    for i in range(n.bit_length):
        if n&(1<<i):
            p=mat_mul(p,x)
        x=mat_mul(x,x)
    return p
x=[[1,1],[1,0]]
x=mat_pow(x,n-2)
print(x[0][0])