def harmonic_sum(n):
  
  if n < 2:
    return 1
  else:
    return 1 / n + (harmonic_sum(n - 1))
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums