def is_polite(n):
	import math 
	 
	n = n + 1
	return (int)(n+(math.log((n + math.log(n, 2)), 2))) 
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