def check_equilateral(x,y,z):
  
  if x == y == z:
	   return True
  else:
     return False
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums