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.
from sys import stdin,stdout
t=int(input())
for i in range(t):
    n=int(input())
    app=[]
    for j in range(2*n-1):
        a,o=(int(o) for o in  stdin.readline().split())
        app.append([a,o,j+1])
    app.sort(reverse=True)
    stdout.write('YES'+'\n')
    stdout.write(str(app[0][2])+' ')
    for j in range(1,2*n-1,2):
        if app[j][1]>app[j+1][1]:
            stdout.write(str(app[j][2])+' ')
        else:
            stdout.write(str(app[j+1][2])+' ')
    stdout.write('\n')