#include<bits/stdc++.h>
#define ll long long
using namespace std;
int t,n,a[2000],b[2000],ans,mark[20];
int f(int x)
{
	int d=0;
	while(x)
	{
		d++;
		x/=10;
	}
	return d;
}
int main(){
	freopen("numlg.in","r",stdin);
	freopen("numlg.out","w",stdout);
cin>>t;
while(t--)
{
	ans=0;memset(mark,0,sizeof(mark));
	cin>>n;
	for(int q=1;q<=n;q++) cin>>a[q];
	for(int q=1;q<=n;q++) cin>>b[q];
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	int flag=1;
	for(int q=1;q<=n;q++)
	{
		for(int w=1;w<=n;w++)
		{
			if(a[q]==b[w])  a[q]=b[w]=0;
		}
	}
	for(int q=1;q<=n;q++)
	{
		if(a[q]>=10)
		{
			ans++;
			a[q]=f(a[q]);
		}
		if(b[q]>=10)
		{
			ans++;
			b[q]=f(b[q]);
		}
	}
	for(int q=1;q<=n;q++)
	{
		mark[a[q]]++;
		mark[b[q]]--;
	}
	for(int q=2;q<=9;q++)
	{
		ans+=abs(mark[q]);
	}
	cout<<ans<<endl;
}
return 0;
}