Question: 
Write a python function to count the number of distinct power of prime factor of given number.


Model's Code:
def count_Fac(n):
    factors = set()
    for i in range(2, n + 1):
        while n % i == 0:
            factors.add(i)
            n //= i
    return len(factors)



Sample Correct Code:
def count_Fac(n):  
    m = n 
    count = 0
    i = 2
    while((i * i) <= m): 
        total = 0
        while (n % i == 0): 
            n /= i 
            total += 1 
        temp = 0
        j = 1
        while((temp + j) <= total): 
            temp += j 
            count += 1
            j += 1 
        i += 1
    if (n != 1): 
        count += 1 
    return count 


Asserts:
assert count_Fac(24) == 3
assert count_Fac(12) == 2
assert count_Fac(4) == 1


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 714 of 974: 539/714 (75.49019607843137%): failed