You are given a positive integer n. Your task is to return the total number of prime factors, counting repeated factors separately.
Input: n = 60
Output: 4
Explanation: The prime factorization of 60 is 2 × 2 × 3 × 5. Counting repeated factors, there are 4 prime factors in total.
Input: n = 8
Output: 3
Explanation: The prime factorization of 8 is 2 × 2 × 2. Therefore, the total number of prime factors is 3.
Input: n = 1
Output: 0
Explanation: The number 1 has no prime factors, so the total count is 0.
Sign in to write, run, and submit your solution against the full test suite.
