#include <iostream>
//#include <fstream>
#include <set>
#define FOR(a,b) for(int i = (a);i < (b);i ++)
using namespace std;class Card
{
public:int h,w;bool operator<(const Card& c) const //插入set时自动排序，要自定义"<"操作符
    {if( h == c.h) return w < c.w;return h < c.h;}bool CanCover(const Card& c) const{return (h >= c.h && w >= c.w);}
};int main()
{//ifstream cin("in.txt");multiset<Card> Alice,Bob;multiset<Card>::iterator ap,bp;Card c;int t,n,ans;cin>>t;while (t --){Alice.clear();Bob.clear();ans = 0;cin>>n;FOR(0,n){cin>>c.h>>c.w;Alice.insert(c);}FOR(0,n){cin>>c.h>>c.w;Bob.insert(c);}ap = Alice.begin();while (ap != Alice.end()){bp = Bob.begin();if(ap->CanCover(*bp)){Bob.erase(bp);ans ++;}ap ++;}cout<<ans<<endl;}
}

#include <iostream>
//#include <fstream>
#include <set>
#include <algorithm>
#define FOR(a,b) for(int i = (a); i < (b); i ++)
using namespace std;
const int maxnum = 100005;struct Card
{int h,w;bool operator<(Card& c){return (h < c.h);}
};Card Alice[maxnum],Bob[maxnum];int main()
{//ifstream cin("in.txt");multiset<int> mi;multiset<int>::iterator mit;int t,n,ans;cin>>t;while (t --){cin>>n;memset(Alice,0,sizeof(Card)*n);memset(Bob,0,sizeof(Card)*n);mi.clear();ans = 0;FOR(0,n){cin>>Alice[i].h>>Alice[i].w;}FOR(0,n){cin>>Bob[i].h>>Bob[i].w;}sort(Alice,Alice+n);sort(Bob,Bob+n);int p = 0;FOR(0,n){            while (p < n && Bob[p].h <= Alice[i].h){mi.insert(Bob[p].w);p ++;}if(mi.size()){mit = mi.lower_bound(Alice[i].w);if(mit == mi.end()) mit --;if(mit != mi.begin() && Alice[i].w < *mit) mit --;if(Alice[i].w >= *mit){mi.erase(mit);ans ++;}}}cout<<ans<<endl;}
}