import copy

def matrixpow(A,n):
  pow2=[A.copy()]
  bit=2
  while bit<=n:
    pow2.append([])
    for i in range(len(A)):
      pow2[-1].append([])
      for j in range(len(A)):
        cnt=0
        for k in range(len(A)):
          cnt+=pow2[-2][i][k]*pow2[-2][k][j]
          cnt=cnt%M
        pow2[-1][-1].append(cnt)
    bit*=2
  ret=0
  bit=str(format(n,"b"))
  for i in range(len(bit)):
    if bit[-i-1]=="1":
      if ret==0:
        ret=pow2[i].copy()
      else:
        befret=copy.deepcopy(ret)
        for j in range(len(A)):
          for k in range(len(A)):
            cnt=0
            for l in range(len(A)):
              cnt+=befret[j][l]*pow2[i][l][k]
              cnt=cnt%M
            ret[j][k]=cnt
  return ret
      
N,M=map(int,input().split())
if N>=3:
  print(matrixpow([[1,1],[1,0]],N-2)[0][0])
else:
	if N==2:
		print(2)
	else:
		print(1)