from math import sqrt





def prime_factorize(n):

    result = []

    for i in range(2, int(sqrt(n)) + 1):

        if n % i != 0:

            continue

        t = 0

        while n % i == 0:

            n //= i

            t += 1

        result.append((i, t))

        if n == 1:

            break

    if n != 1:

        result.append((n, 1))

    return result





N = int(eval(input()))



result = 0

for p, e in prime_factorize(N):

    i = 1

    while e >= i:

        result += 1

        e -= i

        i += 1

print(result)

from math import sqrt





def prime_factorize(n):

    result = []

    if n % 2 == 0:

        t = 0

        while n % 2 == 0:

            n //= 2

            t += 1

        result.append((2, t))

    for i in range(3, int(sqrt(n)) + 1, 2):

        if n % i != 0:

            continue

        t = 0

        while n % i == 0:

            n //= i

            t += 1

        result.append((i, t))

        if n == 1:

            break

    if n != 1:

        result.append((n, 1))

    return result





N = int(eval(input()))



result = 0

for p, e in prime_factorize(N):

    i = 1

    while e >= i:

        result += 1

        e -= i

        i += 1

print(result)

from math import sqrt


def prime_factorize(n):
    result = []
    for i in range(2, int(sqrt(n)) + 1):
        if n % i != 0:
            continue
        t = 0
        while n % i == 0:
            n //= i
            t += 1
        result.append((i, t))
        if n == 1:
            break
    if n != 1:
        result.append((n, 1))
    return result


N = int(eval(input()))
result = 0
for p, e in prime_factorize(N):
    i = 1
    while e >= i:
        result += 1
        e -= i
        i += 1
print(result)

from math import sqrt


def prime_factorize(n):
    result = []
    if n % 2 == 0:
        t = 0
        while n % 2 == 0:
            n //= 2
            t += 1
        result.append((2, t))
    for i in range(3, int(sqrt(n)) + 1, 2):
        if n % i != 0:
            continue
        t = 0
        while n % i == 0:
            n //= i
            t += 1
        result.append((i, t))
        if n == 1:
            break
    if n != 1:
        result.append((n, 1))
    return result


N = int(eval(input()))
result = 0
for p, e in prime_factorize(N):
    i = 1
    while e >= i:
        result += 1
        e -= i
        i += 1
print(result)

-    for i in range(2, int(sqrt(n)) + 1): +    if n % 2 == 0: +        t = 0 +        while n % 2 == 0: +            n //= 2 +            t += 1 +        result.append((2, t)) +    for i in range(3, int(sqrt(n)) + 1, 2):