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 _ in range(t):
    n=int(input())
    nums=[]
    for i in range(2*n-1):
        a,b=map(int,input().split())
        nums.append([b,a,i+1])
    nums=sorted(nums)[::-1]
    vals=[nums[0][2]]
    i=1
    while(i+1<len(nums)):
        c=i
        if(nums[i][1]<nums[i+1][1]):
            c=i+1
        vals.append(nums[c][2])
        i+=2
    print("YES")
    print(*vals)