import Data.Semigroup
import Data.Monoid
import qualified Control.Arrow         as Arrow
import qualified Data.Vector.Unboxed   as VU
import qualified Data.ByteString.Char8 as BSC8

-- https://blog.miz-ar.info/2019/01/fast-fibonacci/

data FibPair a = FibPair !a !a
  deriving (Eq, Show)

instance (Num a) => Semigroup (FibPair a) where
  FibPair a b <> FibPair a' b'
    = FibPair (a * b' + (b - a) * a') (a * a' + b * b')
  stimes = stimesMonoid

instance (Num a) => Monoid (FibPair a) where
  mempty = FibPair 0 1

fibOne :: (Num a) => FibPair a
fibOne = FibPair 1 1

fibPair :: Int -> FibPair Integer
fibPair i = stimesMonoid i fibOne

fastDoubling :: Int -> (Integer, Integer)
fastDoubling 0 = (0, 1)
fastDoubling 1 = (1, 1)
fastDoubling i
  = let (a, b) = fastDoubling (i `quot` 2)
    in if even i
       then (a * (2 * b - a), a * a + b * b)
       else (a * a + b * b, b * (2 * a + b))

fib :: Int -> Integer
fib i = case fastDoubling (i - 1) of
          (a, _) -> a

main :: IO ()
main = do
  (n, mo) <- parse2
  print $ flip mod (fromIntegral mo) $ fib n

type Parser a = BSC8.ByteString -> Maybe (a, BSC8.ByteString)
parseInt :: Parser Int
parseInt = fmap (Arrow.second BSC8.tail) . BSC8.readInt
parse2 :: IO (Int, Int)
parse2 = (\vec -> (vec VU.! 0, vec VU.! 1)) . VU.unfoldrN 2 parseInt <$> BSC8.getLine