def search(arr,n) :
    
    XOR = 0
    for i in range(n) :
        XOR = XOR ^ arr[i]
    return (XOR)
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