def find_fixed_point(arr, n):
	 
	for i in range(n): 
		if arr[i] is i: 
			return i 
	return -1
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