def first_odd(nums):
  
  first_odd = next((el for el in nums if el%2!=0),-1)
  return first_odd
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums