N = int(eval(input()))



def prime_factorize(n):

    if n == 1:

        return []

    ans = []

    tmp = n

    i = 2

    while pow(i, 2) <= n:

        if tmp % i == 0:

            cnt = 0

            while tmp % i == 0:

                cnt += 1

                tmp /= i

            ans.append([i, cnt])

        i += 1

    if tmp != 1:

        ans.append([tmp, 1])

    if ans == []:

        ans.append([n, 1])

    return ans



pl = prime_factorize(N)

ans = 0

for p, n in pl:

    tmp = n

    i = 1

    while tmp-i >= 0:

        tmp -= i

        i += 1

        ans += 1

print(ans)
N = int(eval(input()))



i = 2

tmp = N



ans = 0

while i*i <= N:

    cnt = 0

    while tmp % i == 0:

        tmp //= i

        cnt += 1

    if cnt > 0:

        k = 1

        while cnt - k >= 0:

            cnt -= k

            ans += 1

            k += 1

    i += 1

if tmp != 1:

    ans += 1



print(ans)
N = int(eval(input()))


def prime_factorize(n):
    if n == 1:
        return []
    ans = []
    tmp = n
    i = 2
    while pow(i, 2) <= n:
        if tmp % i == 0:
            cnt = 0
            while tmp % i == 0:
                cnt += 1
                tmp /= i
            ans.append([i, cnt])
        i += 1
    if tmp != 1:
        ans.append([tmp, 1])
    if ans == []:
        ans.append([n, 1])
    return ans


pl = prime_factorize(N)
ans = 0
for p, n in pl:
    tmp = n
    i = 1
    while tmp - i >= 0:
        tmp -= i
        i += 1
        ans += 1
print(ans)

N = int(eval(input()))
i = 2
tmp = N
ans = 0
while i * i <= N:
    cnt = 0
    while tmp % i == 0:
        tmp //= i
        cnt += 1
    if cnt > 0:
        k = 1
        while cnt - k >= 0:
            cnt -= k
            ans += 1
            k += 1
    i += 1
if tmp != 1:
    ans += 1
print(ans)

- - -def prime_factorize(n): -    if n == 1: -        return [] -    ans = [] -    tmp = n -    i = 2 -    while pow(i, 2) <= n: -        if tmp % i == 0: -            cnt = 0 -            while tmp % i == 0: -                cnt += 1 -                tmp /= i -            ans.append([i, cnt]) -        i += 1 -    if tmp != 1: -        ans.append([tmp, 1]) -    if ans == []: -        ans.append([n, 1]) -    return ans - - -pl = prime_factorize(N) +i = 2 +tmp = N -for p, n in pl: -    tmp = n -    i = 1 -    while tmp - i >= 0: -        tmp -= i -        i += 1 -        ans += 1 +while i * i <= N: +    cnt = 0 +    while tmp % i == 0: +        tmp //= i +        cnt += 1 +    if cnt > 0: +        k = 1 +        while cnt - k >= 0: +            cnt -= k +            ans += 1 +            k += 1 +    i += 1 +if tmp != 1: +    ans += 1