Polycarp found n segments on the street. A segment with the index i is described by two integers l_i and r_i — coordinates of the beginning and end of the segment, respectively. Polycarp realized that he didn't need all the segments, so he wanted to delete some of them.

Polycarp believes that a set of k segments is good if there is a segment [l_i, r_i] (1 ≤ i ≤ k) from the set, such that it intersects every segment from the set (the intersection must be a point or segment). For example, a set of 3 segments [[1, 4], [2, 3], [3, 6]] is good, since the segment [2, 3] intersects each segment from the set. Set of 4 segments [[1, 2], [2, 3], [3, 5], [4, 5]] is not good.

Polycarp wonders, what is the minimum number of segments he has to delete so that the remaining segments form a good set?

Input

The first line contains a single integer t (1 ≤ t ≤ 2 ⋅ 10^5) — number of test cases. Then t test cases follow.

The first line of each test case contains a single integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of segments. This is followed by n lines describing the segments.

Each segment is described by two integers l and r (1 ≤ l ≤ r ≤ 10^9) — coordinates of the beginning and end of the segment, respectively.

It is guaranteed that the sum of n for all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case, output a single integer — the minimum number of segments that need to be deleted in order for the set of remaining segments to become good.

Example

Input


4
3
1 4
2 3
3 6
4
1 2
2 3
3 5
4 5
5
1 2
3 8
4 5
6 7
9 10
5
1 5
2 4
3 5
3 8
4 8


Output


0
1
2
0
#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """4
# 3
# 1 4
# 2 3
# 3 6
# 4
# 1 2
# 2 3
# 3 5
# 4 5
# 5
# 1 2
# 3 8
# 4 5
# 6 7
# 9 10
# 5
# 1 5
# 2 4
# 3 5
# 3 8
# 4 8
# """
# sys.stdin = io.StringIO(_INPUT)

def solve(N, L, R):

    # L1: 始点でソート
    L1 = sorted(L)

    # R1: 終点でソート
    R1 = sorted(R)

    group_size_max = 0

    for i in range(N):

        l = L[i]
        r = R[i]

        # r < 始点 であるセグメントの数
        n1 = N - bisect.bisect_right(L1, r)

        # 終点 < l であるセグメントの数
        n2 = bisect.bisect_left(R1, l)

        group_size = N - n1 - n2
        group_size_max = max(group_size_max, group_size)

    return N - group_size_max

def main():
    T0 = int(input())
    for _ in range(T0):
        N = int(input())
        L = []
        R = []
        for i in range(N):
            l, r = map(int, input().split())
            L.append(l)
            R.append(r)
        ans = solve(N, L, R)
        print(ans)

if __name__ == '__main__':
    main()
