def Check_Solution(a,b,c):
     
    if (2*b*b == 9*a*c): 
        return ("Yes"); 
    else: 
        return ("No"); 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums