def fibo(n):
    a, b = 0, 1
    if n == 1:
        return a
    elif n == 2:
         return b
    else:
        for i in range(n-2):
            a, b = b, a + b
        return b


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

ans = [fibo(n) for n in range(1, n+1)]
    
print(ans[n-1] % m)