from math import gcd
import random
from collections import defaultdict


def is_prime(n):
    if n == 2:
        return True
    if n == 1 or n & 1 == 0:
        return False
    d = (n - 1) >> 1
    while d & 1 == 0:
        d >>= 1

    for k in range(100):
        a = random.randint(1, n - 1)
        t = d
        y = pow(a, t, n)
        while t != n - 1 and y != 1 and y != n - 1:
            y = (y * y) % n
            t <<= 1
        if y != n - 1 and t & 1 == 0:
            return False
    return True


def prime_fact(n):
    res = defaultdict(int)
    if n == 1:
        return res
    p = 2
    while p <= 10 ** 4 and n > 1:
        if n % p == 0:
            while n % p == 0:
                res[p] += 1
                n //= p
        p += 1
    while n > 1:
        if is_prime(n):
            res[n] += 1
            break
        x = random.randrange(n)
        y = (x * x + 1) % n
        i = 1
        while True:
            d = gcd(abs(x - y), n)
            if d == 1:
                i += 1
            elif d == n:
                res[n] += 1
                return res
            else:
                res[d] += 1
                n //= d
                break
            x = (x * x + 1) % n
            y = (y * y + 1) % n
            y = (y * y + 1) % n
    return res


def main():
    n = int(input())
    ans = sum([x * y for x, y in prime_fact(n).items()])
    print(ans)


if __name__ == "__main__":
    main()