def odd_position(nums):
	
	return all(nums[i]%2==i%2 for i in range(len(nums)))
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