import Data.List

main = do
  n <- readLn
  putStrLn $ show n ++ ": " ++ unwords (fmap show $ solve n)

factors :: Int -> [Int]
factors n = [d | d <- 2:[3,5..n], n `mod` d == 0]

primeFactor :: Int -> [Int]
primeFactor 1 = []
primeFactor n = d : primeFactor (n `div` d)
  where d = factors n !! 1

solve :: Int -> [Int]
solve n = reverse $ primeFactor2 [] n

primeFactor2 :: [Int] -> Int -> [Int]
primeFactor2 res 1 = res
primeFactor2 res n = primeFactor2 (d : res) (n `div` d)
    where d = head $ factors n