def digit_distance_nums(n1, n2):
         
         return sum(map(int,str(abs(n1-n2))))
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums