object Main extends App {
  val in = new java.util.Scanner(System.in)
  val N = in.nextLong

  val divs = 0 +: (1 to 10).flatMap(i => Array.fill(i + 1)(i))
  val primes: LazyList[Int] = 2 #:: (LazyList.from(3, 2) filter {n =>
    primes takeWhile {_ <= Math.sqrt(n).toInt} forall {n % _ != 0}
  })

  def div(n: Long, ps: LazyList[Int], c: Int): Int = {
    if (n == 1L) c
    else if (ps.head >= 1000000) c + 1
    else {
      def divCount(n0: Long, p: Long, c0: Int): (Long, Int) = {
        if (n0 % p == 0) divCount(n0 / p, p, c0 + 1)
        else (n0, c0)
      }
      val (n0, c0) = divCount(n, ps.head, 0)
      div(n0, ps.tail, c + divs(c0))
    }
  }

  println(div(N, primes, 0))
}