def min_val(listval):
     
     min_val = min(i for i in listval if isinstance(i, int))
     return min_val
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums