def next_Perfect_Square(N):
    import math  
     
    nextN = math.floor(math.sqrt(N)) + 1
    return nextN * nextN 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums