from math import *

def smallest_divisor(n):
    for i in range(2, ceil(sqrt(n)) + 1):
        if i < n and n % i == 0:
            return i
    return -1

num = int(input())

res = 1
x = smallest_divisor(num)
while x > 1:
    res += 1
    num /= x
    x = smallest_divisor(num)
    
print(res + 1)