def check_Consecutive(l):
     
    return sorted(l) == list(range(min(l),max(l)+1)) 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums