In 2*N* - 1 boxes there are apples and oranges. Your task is to choose *N* boxes so, that they will contain not less than half of all the apples and not less than half of all the oranges.
The first input line contains one number *T* — amount of tests. The description of each test starts with a natural number *N* — amount of boxes. Each of the following 2*N* - 1 lines contains numbers *a*<sub class="lower-index">*i*</sub> and *o*<sub class="lower-index">*i*</sub> — amount of apples and oranges in the *i*-th box (0 ≤ *a*<sub class="lower-index">*i*</sub>, *o*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>). The sum of *N* in all the tests in the input doesn't exceed 10<sup class="upper-index">5</sup>. All the input numbers are integer.
t = int(input())

boxes = []

while t:
	t = t-1
	n = int(input())
	num_box = (2*n)-1
	for i in range(num_box):
		pair = input().split()
		apples = int(pair[0])
		oranges = int(pair[1])
		boxes.append((apples, oranges, i+1))

	print("YES")
	boxes.sort(reverse=True)

	orange_boxes = list(zip(*boxes))[1]
	total_oranges = sum(orange_boxes)

	half_sum1 = sum(orange_boxes[::2])
	half_sum2 = sum(orange_boxes[1::2])

	index_list = list(list(zip(*boxes))[2])
	index_list1 = index_list[::2]
	index_list2 = index_list[1::2]
	index_list2.append(index_list1[0])

	if half_sum1 >= half_sum2:
		print(*index_list1, sep=' ')

	else: 
		print(*index_list2, sep=' ')
