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 i in range(T):
    N = int(input())
    apples = 0
    oranges = 0
    boxes = []
    for j in range(2*N-1):
        a, o = map(int, input().split())
        apples += a 
        oranges += o 
        boxes.append([a,o])

    if apples % N == 0 and oranges % N == 0: # check if it is possible to divide the fruits equally among the boxes 

        apple_req = apples // N  # required number of apples in each box 
        orange_req = oranges // N # required number of oranges in each box 

        flag = False # flag to check if the required number of fruits can be achieved by selecting the boxes 

        for k in range(2**(2*N-1)): # loop through all possible combinations of boxes 

            curr_apples = 0 # current number of apples selected from the combination of boxes 
            curr_oranges = 0 # current number of oranges selected from the combination of boxes  

            for l in range(2*N-1): # loop through all the boxes  

                if (k & (1 << l)) > 0: # check if the box is selected or not  

                    curr_apples += boxes[l][0] # add the number of apples present in that box to curr_apples  
                    curr_oranges += boxes[l][1] # add the number of oranges present in that box to curr_oranges  

            if curr_apples >= apple_req and curr_oranges >= orange_req: # check if we have achieved our required numbers or not  

                flag = True 
                break 

        if flag == True: # print YES and list out all the indexes which are selected  

            print("YES") 
            for m in range(2*N-1): 

                if (k & (1 << m)) > 0: 

                    print(m+1, end=" ")  

            print()     

        else: # otherwise print NO  

            print("NO")
