def sum_digits(n):
  
  if n == 0:
    return 0
  else:
    return n % 10 + sum_digits(int(n / 10))
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums