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.
class Box:
    def __init__(self, idx, a, b):
        self.idx = idx
        self.a = a
        self.b = b
t = int(input())
for i in range(t):
    n = int(input())
    suma = 0
    sumb = 0
    
    box = [0]*(2*n-1)
    
    for i in range(2*n-1):
        a, b = map(int, input().split())
        box[i] = Box(i+1, a, b)
        suma += a
        sumb += b
    suma = suma/2
    sumb = sumb/2
    
    box = [0]+box
    sum_odd = 0
    sum_even = 0
    for i in range(1, 2*n, 2):
        sum_odd += box[i].b
    
    if sum_odd >= sumb:
        print('YES')
        for i in range(1, 2*n, 2):
            print(box[i].idx, '', end = '')
    else:
        for i in range(2, 2*n, 2):
            sum_even += box[i].b
        print('YES')
        print(box[1].idx, '', end = '')
        for i in range(2, 2*n, 2):
            print(box[i].idx, '', end = '')
        