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())
for z in range(t):
    n=int(input())
    s1=0
    s2=0
    l1=[]
    l2=[]
    l3=[]
    for i in range(2*n-1):
        a,b=map(int,input().split())
        s1+=a/2
        s2+=b/2
        l1.append(a)
        l2.append(b)
        l3.append(((a+b)*a*b,i))
    l4=l3[:]
    l4.sort()
    l4.reverse()
    d1=0
    d2=0
    
    for i in range(n):
        d1+=l1[l4[i][1]]
        d2+=l2[l4[i][1]]
    if d1<s1 or d2<s2:
        print("NO")
    else:
        print("YES")
        for i in range(n):
            print(l4[i][1]+1,end=" ")
        print()
            



        
    
    
