def next_Perfect_Square(N):
    import math  
     
    nextN = math.floor(math.sqrt(N)) + 1
    return nextN * nextN 
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