def find_fixed_point(arr, n):
	 
	for i in range(n): 
		if arr[i] is i: 
			return i 
	return -1
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums