//test code
import java.util.*
import kotlin.math.*

fun main(args: Array<String>) {
    val sc = Scanner(System.`in`)
    val n = sc.nextLong()
    println(problem169d(n))
}

fun problem169d(n: Long): Int {
    if (n == 1L) return 0
    /**
     * エラトステネスのふるい。1からnまでの素数を列挙する
     */
    fun sieveOfEratosthenes(n: Int): List<Long> {
        val primes : MutableList<Long> = mutableListOf()
        val isprime = MutableList<Boolean>(n+1){true}
        for (i in 2..n) {
            if (isprime[i]) {
              primes.add(i.toLong())
                for (j in i * 2..n step i) {
                    isprime[j] = false
                }
            }
        }
        return primes
    }

    val sosu = sieveOfEratosthenes(1000010)
    
    fun computePrimeFactorList(n: Long): List<Pair<Long, Long>> {
        val p = mutableListOf<Pair<Long, Long>>()
        var primeFactor = n
        for (i in sosu) {
            var count = 0L
            while (primeFactor % i == 0L) {
                primeFactor /= i
                count++
                if (primeFactor == 1L) break
            }
            p.add(i to count)
        }
        if (primeFactor != 1L) p.add(primeFactor to 1L)
        return p
    }
 
    val pf = computePrimeFactorList(n)
    var count = 0
    for (i in 0 until pf.size) {
        var (a, b) = pf[i]
        var j = 1
        while (b > 0) {
            if (b < j) break
            b -= j
            count++
            j++
        }
    }
    return count
}
