import java.util.Scanner
import math.sqrt

object Main extends App {
  def readALine(c:Int, ac:List[Int]):List[Int] =
    if (c > 0) readALine(c-1, sc.nextInt::ac) else ac.reverse
  def readLines(r:Int, c:Int, ac:List[List[Int]]):List[List[Int]] =
    if (r > 0) readLines(r-1, c, readALine(c, Nil)::ac) else ac.reverse
  val sc = new Scanner(System.in)
  val N = sc.nextLong

  def factorize(n:Long):List[(Long, Long)] = {
    def makePrimeLike():(()=>Long) = {
      val primes:Array[Long] = Array(2,3,5,7,11,13,17,19,23,29)
      var num = 0
      () => {
        if (num < 10) { num +=1; primes(num-1)}
        else if ((num & 1) == 1) { num +=1; (num>>1)*6 -1} else {num +=1; (num>>1)*6 +1} 
      }      
    }
    val generator = makePrimeLike()

    def iter(n:Long, ac:List[(Long, Long)]):List[(Long, Long)] = {
      def isDivided(n:Long, d:Long):Boolean = n == (n/d)*d
      def iterDev(n:Long, d:Long, c:Long):(Long, Long, Long) =
        if (isDivided(n, d)) iterDev(n/d, d, c+1) else (n, d, c)
      
      val div = generator()

      if (n == 1) ac
      else if (n < div*div) (n, 1L)::ac 
      else {
        val (q, d, c) = iterDev(n, div, 0)
        if (c > 0) iter(q, (d, c)::ac) else iter(q, ac)
      }
    }
    iter(n, Nil)    
  }

  def solver(n:Long):Long = {
    val factor = factorize(n)
    factor.map((t) => t match { case (a, x) => ((sqrt(8*x+1)-1)/2).toLong }).sum 
  }

  println(solver(N))

}