def first_Digit(n) :
      
    while n >= 10:  
        n = n / 10; 
    return int(n) 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums