def search(arr,n) :
    
    XOR = 0
    for i in range(n) :
        XOR = XOR ^ arr[i]
    return (XOR)
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums