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.
def solve_test(N, boxes):
    total_apples = sum(box[0] for box in boxes)
    total_oranges = sum(box[1] for box in boxes)
    
    half_apples = total_apples // 2
    half_oranges = total_oranges // 2
    
    chosen_boxes = []
    
    for i, (apples, oranges) in enumerate(boxes):
        if apples >= half_apples and oranges >= half_oranges:
            chosen_boxes.append(i + 1)
            N -= 1
            if N == 0:
                break
    
    if len(chosen_boxes) == N:
        return ("NO", [])
    else:
        return ("YES", chosen_boxes)

T = int(input().strip())

for _ in range(T):
    N = int(input().strip())
    boxes = []
    for _ in range(2 * N - 1):
        a, o = map(int, input().split())
        boxes.append((a, o))
    
    result, chosen_boxes = solve_test(N, boxes)
    print(result)
    if chosen_boxes:
        print(" ".join(map(str, chosen_boxes)))
