#include "stdio.h"
#define MAXSIZE 100
#define MIN -5000

typedef struct point{
	float elemX;
	float elemY;
	int visit;
}point;

int main()
{
	int index(point black[],point white[],int n);
	int k=1,l;//測試數據個數
	int n;//點的個數
	int i;//用于循環
	point black[MAXSIZE],white[MAXSIZE];
	scanf("%d",&l);
	while(k<=l)
	{
		scanf("%d",&n);
		black[0].elemX=MIN;
		black[0].elemY=MIN;
		black[n+1].elemX=MIN;
		black[n+1].elemY=MIN;
		white[0].elemX=MIN;
		white[0].elemY=MIN;
		for(i=1;i<=n;i++)
		{
			black[i].visit=0;
			scanf("%f%f",&black[i].elemX,&black[i].elemY);
		}
		for(i=1;i<=n;i++)
		{
			white[i].visit=0;
			scanf("%f%f",&white[i].elemX,&white[i].elemY);
		}
		index(black,white,n);
		k++;
	}
	return 1;
}


/*******************************
*   歸并排序
*   來源：嚴蔚敏編寫的數據結構 *
*******************************/
 void Merge(point SR[],point TR[],int i,int m,int n)
 { /* 將有序的SR[i..m]和SR[m+1..n]歸并為有序的TR[i..n] 算法10.12 */
	 //TR[]為輔助數組
   int j,k,l;
   for(j=m+1,k=i;i<=m&&j<=n;++k) /* 將SR中記錄由小到大地并入TR */
     if (SR[i].elemX>=SR[j].elemX)
	 {
       TR[k].elemX=SR[i].elemX;
	   TR[k].elemY=SR[i].elemY;
	   TR[k].visit=SR[i].visit;
	   i++;
	 }
     else
	 {
       TR[k].elemX=SR[j].elemX;
	   TR[k].elemY=SR[j].elemY;
	   TR[k].visit=SR[j].visit;
	   j++;
	 }
   if(i<=m)
     for(l=0;l<=m-i;l++)
	 {
       TR[k+l].elemX=SR[i+l].elemX; 
	   TR[k+l].elemY=SR[i+l].elemY; 
	   TR[k+l].visit=SR[i+l].visit; 
	 }/* 將剩余的SR[i..m]復制到TR */
   if(j<=n)
     for(l=0;l<=n-j;l++)
	 {
       TR[k+l].elemX=SR[j+l].elemX; 
	   TR[k+l].elemY=SR[j+l].elemY;
	   TR[k+l].visit=SR[j+l].visit;
	 }/* 將剩余的SR[j..n]復制到TR */
//   for(i=1;i<=n;i++)
//	   SR[i]=TR[i];
 }

 void MSort(point SR[],point TR1[],int s, int t)
 { /* 將SR[s..t]歸并排序為TR1[s..t]。算法10.13 */
   int m;
   point TR2[MAXSIZE+1];
   if(s==t)
   {
     TR1[s].elemX=SR[s].elemX;
	 TR1[s].elemY=SR[s].elemY;
	 TR1[s].visit=SR[s].visit;
   }
   else
   {
     m=(s+t)/2; /* 將SR[s..t]平分為SR[s..m]和SR[m+1..t] */
     MSort(SR,TR2,s,m); /* 遞歸地將SR[s..m]歸并為有序的TR2[s..m] */
     MSort(SR,TR2,m+1,t); /* 遞歸地將SR[m+1..t]歸并為有序的TR2[m+1..t] */
     Merge(TR2,TR1,s,m,t); /* 將TR2[s..m]和TR2[m+1..t]歸并到TR1[s..t] */
   }
 }

/*****************************
*   具體匹配算法             *
*****************************/


int index(point black[],point white[],int n)
{
	int i=1,j=1;//用與循環
	int k=0;//用于記數
	int flag=0;
//	float BtempX,BtempY;//臨時存放黑子的橫坐標和縱坐標
//	float WtempX,WtempY;//臨時存放白子的橫縱坐標
	int MAX=0;//用于存放當X坐標相同時的最大縱坐標的下標位置
	MSort(black,black,1,n);
	MSort(white,white,1,n);//對黑子和白子按橫坐標從大到小排序
	for(i=n;i>0;i--)
	{
//		flag=0;
//		BtempX=black[i].elemX;
//		BtempY=black[i].elemY;
		black[i].visit=1;
		MAX=0;
		j=n;
		while(j>0)
		{	
			if(!white[j].visit)
			{
/*				if(white[j].elemX>=black[i+1].elemX)
				{
					if(white[j].elemX<=black[i].elemX
						&&white[j].elemY>=white[MAX].elemY
						&&white[j].elemY<=black[i].elemY)
					{
						flag=1;
						MAX=j;
					}
				}
				else 
				{
					if(flag) break;
					if(white[j].elemY<=black[i].elemY
						&&white[j].elemY>=white[MAX].elemY)
						MAX=j;
				}*/
				if(white[j].elemX<=black[i].elemX
					&&white[j].elemY>=white[MAX].elemY
					&&white[j].elemY<=black[i].elemY)
					MAX=j;
			}
			j--;
		}
		if(!white[MAX].visit&&MAX)
		{
			white[MAX].visit=1;
			k++;
		}
	}
	printf("%d\n",k);
	return 1;
}