def count_Occurrence(tup, lst):
    from collections import Counter 
     
    count = 0
    for item in tup: 
        if item in lst: 
            count+= 1 
    return count  
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums