def count_Set_Bits(n):
     
    count = 0
    while (n): 
        count += n & 1
        n >>= 1
    return count 
def is_not_prime(n):
    import math
    
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result