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
import java.util.*;

public class F{
	
	static class Line{
		int l;
		int r;
		
		Line(int l ,int r){
			this.l = l;
			this.r = r;
		}
		
		public String toString(){
			return "[" + l + ", " + r + "] ";
		}
	}
	
	static void test(){
		int[] arr = {2,3,5,5};
		n = 4;
		
		System.out.println((findPosLeft(4, arr)+1));
		// System.out.println("4 = " + findPos(4,arr));
		// System.out.println("2 = " + findPos(2,arr));
		// System.out.println("1 = " + findPos(1,arr));		
		// System.out.println("0 = " + findPos(0,arr));		
		// System.out.println("6 = " + findPos(6,arr));		
		// System.out.println("3 = " + findPos(3,arr));		
	}
	
	static int n;
	
	static int findPosRight(int value, int[] arr){
		int l = 1;
		int r = n+1;
		int res = -1;
		// System.out.println("Right" );
		while(l+1 < r){
			int mid = (l+r)/2;
			if(arr[mid] <= value)
				l = mid+1;
			else r = mid;
			// System.out.println("l = " + l + ", r = " + r);
		}
		return l <=n && arr[l] <= value ? l+1 : l;
		// return l;
	}
	
	static int findPosLeft(int value, int[] arr){
		int l = 1;
		int r = n+1;
		int res = -1;
		// System.out.println("Left" );
		while(l+1 < r){
			int mid = (l+r)/2;
			if(arr[mid] < value){
				l = mid+1;
			}
			else{ r = mid;}
			// System.out.println("l = " + l + ", r = " + r);
		}
		return l >=1 && arr[l] >= value ? l-1 : l;
	}
	
	public static void alg(){
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		StringBuilder str = new StringBuilder();
		for(int j = 0;j<t;++j){
			n = in.nextInt();
			Line[] lines = new Line[n];
			int[] rs = new int[n+2];
			int[] ls = new int[n+2];
			for(int i = 0;i<n;++i){
				int l = in.nextInt();
				int r = in.nextInt();
				lines[i] = new Line(l,r);
				rs[i] = r;
				ls[i] = l;
			}
			rs[n] = Integer.MAX_VALUE;
			rs[n+1] = Integer.MIN_VALUE;
			ls[n+1] = Integer.MIN_VALUE;
			ls[n] = Integer.MAX_VALUE;
			Arrays.sort(rs);
			Arrays.sort(ls);
			// System.out.println(Arrays.toString(rs));
			// System.out.println(Arrays.toString(ls));
			long res = Integer.MAX_VALUE;
			for(int i = 0;i<n;++i){
				long temp = 0;
				long lres = findPosLeft(lines[i].l, rs);
				long rres = findPosRight(lines[i].r, ls);
				temp += lres;
				temp +=  n + 1 - rres;
				
				res = Math.min(res,temp);
				// System.out.println("i = " + i + ", res = " + temp + ", left = " + lres + ", right = " + (n + 1  - rres));
			}
			str.append(res + "\n");
		}
		System.out.println(str.toString());
	}
	public static void main(String[] args){
		// test();
		alg();
	}
}