def is_polite(n):
	import math 
	 
	n = n + 1
	return (int)(n+(math.log((n + math.log(n, 2)), 2))) 
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums