#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN=100005;
struct node
{
    int x,y;
}a[MAXN];
char c;
int t,n,m,i,j,l,r,mid,a2[MAXN<<1],d[MAXN<<1],ans;
inline void get(int &N)
{
    for(c=getchar();c<'0'||c>'9';c=getchar());
    for(N=0;c>='0'&&c<='9';c=getchar())N=N*10+c-'0';
}
inline int Q(int X)
{
    l=0;
    r=m;
    while(l+1<r)
    {
        mid=l+r>>1;
        if(X<=a2[mid])r=mid;
        else l=mid;
    }
    return r;
}
int main()
{
    get(t);
    while(t--)
    {
        get(n);
        m=ans=j=0;
        memset(d,0,sizeof(d));
        for(i=1;i<=n;i++)
        {
            get(a[i].x);
            get(a[i].y);
            a2[++m]=a[i].x;
            a2[++m]=a[i].y;
        }
        sort(a2+1,a2+m+1);
        m=unique(a2+1,a2+m+1)-a2-1;
        for(i=1;i<=n;i++)
        {
            d[Q(a[i].x)]++;
            d[Q(a[i].y)+1]--;
        }
        for(i=1;i<=m;i++)
        {
            j+=d[i];
            ans=max(ans,j);
        }
        cout<<ans<<endl;
    }
    return 0;
}