#include<iostream>
using namespace std;
struct area
{
int left;
int right;
};
bool isin(int x,int left,int right)
{
x=(x+1)/2;
left=(left+1)/2;
right=(right+1)/2;
if(x>=left&&x<=right)
return true;
return false;
}
int main()
{
int T,N,i,j,k,max,count;
area *p;
cin>>T;
k=0;
while(cin>>N)
{
p=new area[N];
for(i=0;i<N;i++)
{
cin>>p[i].left>>p[i].right;
if(p[i].left>p[i].right)
{
int temp;
temp=p[i].left;
p[i].left=p[i].right;
p[i].right=temp;
}
}
max=0;
for(i=0;i<N;i++)
{
count=0;
for(j=0;j<N;j++)
if(isin(p[i].left,p[j].left,p[j].right))
count++;
if(count>max)
max=count;
}
cout<<max*10<<endl;
k++;
if(k==T)
break;
}
return 0;
}