#include<bits/stdc++.h> 
using namespace std;int t,n,a[201],b[201];int turn(int x){int time=1;while(x/10!=0) {time++;x=x/10;}return time;}bool cmp(int a,int b){return a>b;}int main(){freopen("numlg.in","r",stdin);freopen("numlg.out","w",stdout);cin>>t;while(t>0){t--;cin>>n;int ans=0,n1=n,nub1=0,nub2=0;for(int i=1;i<=n;++i){cin>>a[i];if(a[i]==1) nub1++;}for(int i=1;i<=n;++i){cin>>b[i];if(b[i]==1) nub2++;for(int j=1;j<=n;++j){if(b[i]==a[j]){n1--;a[j]=0; b[i]=0;break;}}}if(n1==0){cout<<0<<endl;continue;}int n2=n1;sort(a+1,a+1+n,cmp); sort(b+1,b+1+n,cmp);for(int i=1;i<=n1;++i){if(a[i]>=10) {a[i]=turn(a[i]);ans++;}}for(int i=1;i<=n2;++i){if(b[i]>=10) {b[i]=turn(b[i]);ans++;}for(int j=1;j<=n2;++j){if(b[i]==a[j]){n1--;a[j]=0; b[i]=0;break;} }}cout<<ans+2*n1-abs(nub1-nub2)<<endl;}return 0;}