def sqrt_root(num):
 import math
 
 sqrt_root = math.pow(num, 0.5)
 return sqrt_root 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums