Counting Total Prime Factors

You are given a positive integer n. Your task is to determine the total number of its prime factors including repetitions. For example, for n = 12, the prime factors are 2, 2, and 3, which gives a total count of 3. In formal terms, if n is decomposed as n = p₁^a₁ × p₂^a₂ × ... × p_k^a_k, your output should be a₁ + a₂ + ... + a_k.

The input is provided via standard input and consists of a single integer. The output should be printed on standard output as a single integer representing the total count of prime factors.

inputFormat

The input consists of one line containing a single integer n (1 ≤ n ≤ 10⁹).

outputFormat

Output a single integer representing the total number of prime factors of n including repetitions.

12

3