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.
# 解説を見た
# 一見天才だが、「半分以上」を考えるとき、「ソートして隣同士を比較」は定石の一つ。

import sys
input = sys.stdin.readline
from operator import itemgetter

T=int(input())
for tests in range(T):
    N=int(input())
    X=[]
    for i in range(2*N-1):
        a,b=map(int,input().split())
        X.append((a,b,i+1))

    X.sort(key=itemgetter(0))

    ANS=[]
    for i in range(N-1):
        if X[2*i][1]<X[2*i+1][1]:
            ANS.append(X[2*i+1][2])
        else:
            ANS.append(X[2*i][2])

    ANS.append(X[2*N-2][2])

    print("YES")
    print(*ANS)
            
