n,m=map(int,input().split())
dp=[None]*(n+1)
dp[0]=0
dp[1]=1


def fib(n):
    for i in range(2,n+1):
        dp[i]=dp[i-1]+dp[i-2]
    return dp[n]

print(fib(n)%m)