def round_num(n,m):
    
    a = (n //m) * m
    b = a + m
    return (b if n - a > b - n else a)
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