def right_insertion(a, x):
    import bisect
    
    i = bisect.bisect_right(a, x)
    return i
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