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.
aa=a=b=ln=0
def fun(i,tot,tot2,ans):
    if i==ln:
        if tot>=int(a/2) and tot2>=int(b/2):  return 1
        else:   return 0
    ans.append(-1)
    for x in range(i,ln+i):
        ans[-1]=x
        if fun(i+1,tot+aa[x][0],tot+aa[x][1],ans):
            return ans
    return 0
cas=int(input())
while cas>0:
    cas-=1
    ln=int(input())
    aa=[]
    a=b=0
    for x in range(ln*2-1):
        bb=input().split(' ')
        bb[0]=int(bb[0])
        bb[1]=int(bb[1])
        aa.append(bb)
        a+=bb[0]
        b+=bb[1]
    ans=[]
    ans=fun(0,0,0,ans)
    if ans:
        print('YES')
        an=''
        for a in ans:
            an+='{} '.format(a+1)
        print(an)
    else:   print('NO')