def f(exponent):

	#reurns how many times a prime raised to exponent can be used

	step = 1

	cumul = 0

	count = 0

	while( cumul <= exponent):

		cumul += step

		count +=1

		step +=1

	return count - (1 if cumul > exponent else 0)



def answer(n):

	if n == 1: return 0

	res = 0

	on = n

	p = True

	for d in range(2, int(on ** 0.5) + 2):

		if n % d == 0:

			p = False

			e = 0

			while(n%d == 0): 

				e +=1

				n/=d

			res+= f(e)

	if n > 1: res += 1

	return res



print(answer(int(input())))
def f(exponent):

	#reurns how many times a prime raised to exponent can be used

	step = 1

	cumul = 0

	count = 0

	while( cumul <= exponent):

		cumul += step

		count +=1

		step +=1

	return count - (1 if cumul > exponent else 0)



def answer(n):

	if n == 1: return 0

	res = 0

	for d in range(2, int(n ** 0.5) + 2):

		if n % d == 0:

			e = 0

			while(n%d == 0): 

				e +=1

				n/=d

			res+= f(e)

	if n > 1: res += 1

	return res



print(answer(int(input())))
def f(exponent):
    # reurns how many times a prime raised to exponent can be used
    step = 1
    cumul = 0
    count = 0
    while cumul <= exponent:
        cumul += step
        count += 1
        step += 1
    return count - (1 if cumul > exponent else 0)


def answer(n):
    if n == 1:
        return 0
    res = 0
    on = n
    p = True
    for d in range(2, int(on**0.5) + 2):
        if n % d == 0:
            p = False
            e = 0
            while n % d == 0:
                e += 1
                n /= d
            res += f(e)
    if n > 1:
        res += 1
    return res


print(answer(int(input())))

def f(exponent):
    # reurns how many times a prime raised to exponent can be used
    step = 1
    cumul = 0
    count = 0
    while cumul <= exponent:
        cumul += step
        count += 1
        step += 1
    return count - (1 if cumul > exponent else 0)


def answer(n):
    if n == 1:
        return 0
    res = 0
    for d in range(2, int(n**0.5) + 2):
        if n % d == 0:
            e = 0
            while n % d == 0:
                e += 1
                n /= d
            res += f(e)
    if n > 1:
        res += 1
    return res


print(answer(int(input())))

-    on = n -    p = True -    for d in range(2, int(on**0.5) + 2): +    for d in range(2, int(n**0.5) + 2): -            p = False