#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	ll x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
} 
inline void write(ll x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
//////////
const int N=205;
int tc,nc;
ll a[N],b[N];
int ja,jb;
int ans;
inline ll f(ll x)
{
	ll re=0;
	while(x!=0) x/=10,re++;
	return re;
}
inline void solve()
{
	ans=0;
	nc=read();
	rep(i,1,nc) a[i]=read();
	rep(i,1,nc) b[i]=read();
	sort(a+1,a+nc+1);
	sort(b+1,b+nc+1);
	ja=jb=nc;
	while(ja!=0&&jb!=0)
	{
		if(a[ja]==b[jb])
		{
			a[ja]=b[jb]=0;
			ja--;
			jb--;
			continue;
		}
		if(a[ja]>b[jb]) 
		{
			if(a[ja]>9) a[ja]=f(a[ja]),ans++;
			ja--;
		}
		else 
		{
			if(b[jb]>9) b[jb]=f(b[jb]),ans++;
			jb--;
		}
	}
	sort(a+1,a+nc+1);
	sort(b+1,b+nc+1);
	ja=jb=nc;
	while(ja!=0&&jb!=0)
	{
		if(a[ja]==b[jb])
		{
			ja--;
			jb--;
			continue;
		}
		if(a[ja]>b[jb]) 
		{
			if(a[ja--]!=1) ans++;
		}
		else 
		{
			if(b[jb--]!=1) ans++;
		}
	}
	write(ans),putchar(10);
}
int main()
{
    freopen("numlg.in","r",stdin);
	freopen("numlg.out","w",stdout);
    tc=read();
    rep(i,1,tc) solve();
    return 0;
}