def first_odd(nums):
  
  first_odd = next((el for el in nums if el%2!=0),-1)
  return first_odd
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