def count_char(string,char):
 
 count = 0
 for i in range(len(string)):
    if(string[i] == char):
        count = count + 1
 return count
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums