import Data.List
import Data.Numbers.Primes

toInt :: String -> Int
toInt = read :: String -> Int

triangleNumbers :: [Int]
triangleNumbers = [div (n*(n+1)) 2 | n <- [1..]]

getDivideCount :: Int -> Int
getDivideCount n = length $ takeWhile (<= n) triangleNumbers

main = do
  n <- toInt <$> getLine
  print $ sum . map getDivideCount . map length . group . primeFactors $ n
