import Data.List (sort, group)

factorize :: Integer -> [(Integer, Integer)]
factorize n  = factorize' n 2
  where
    factorize' n m
      | m * m > n = if n > 1 then [(n, 1)] else []
      | n `mod` m == 0 = let (n', k) = divide n m 0
                         in (m, k) : factorize' n' (m + 1)
      | otherwise = factorize' n (m + 1)
    divide n m k
      | n `mod` m == 0 = divide (n `div` m) m (k + 1)
      | otherwise = (n, k)

divisor :: Integer -> [Integer]
divisor n = divisor' $ factorize n
  where
    divisor' [] = [1]
    divisor' ((x, k) : l) = do
      a <- map (x^) [0..k]
      b <- divisor' l
      return $ a * b

main = do
  n <- readLn
  let generateId (a, b) = show a ++ show b
      l = length . group . sort . map generateId . map (\x -> (x, n `div` x)) $ divisor n
  print l