/*

@theme:poj1083

@writer:pprp

@begin:19:30

@end:19:50

@declare:很简单的遍历就OK

@error:审题要仔细，理解题意，

不能只理解大概，记得要把freopen给注释了再提交

@date:2017/9/2

*/

#include <iostream>

#include <cstring>

#include <cstdio>

using namespace std;

int arr[];

int main()

{

    freopen("in.txt","r",stdin);

    int cas, N, Max = ;

    int a, b;

    cin >> cas;

    while(cas--)

    {

        Max = -;

        memset(arr,,sizeof(arr));

        cin >> N;

        for(int i =  ; i < N ; i++)

        {

            cin >> a >> b;//to mentain a < b

            if(a > b)

                swap(a,b);

            for(int i = (a-)/ ; i <= (b-)/ ; i++)

            {

                arr[i]++;

            }

        }

        for(int i =  ; i < ; i++)

        {

            Max = max(Max,arr[i]);

        }

        cout << Max *  << endl;

    }

    return ;

}