#yuki_526

n,m=map(int,raw_input().split())

dp=[0 for i in xrange(n+1)]
def fib(x,y):
 if x==0:
  return 0
 dp[0]=0
 dp[1]=1
 for i in xrange(2,x+1):
  dp[i]=(dp[i-2]+dp[i-1])%y
 return dp[x]

print fib(n-1,m)