#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=;
int a[maxn],b[maxn],d[maxn],n,i,t,j,k,l,x,y,ans,c[];
int main(){
// freopen("data.in","r",stdin);
scanf("%d",&l);
while (l){
scanf("%d",&n);
for (i=;i<=n;i++)
scanf("%d",&a[i]);
for (i=;i<=n;i++)
scanf("%d",&b[i]),d[i]=(b[i]+-a[i])%;
t=;ans=;memset(c,,sizeof(c));
for (i=n;i>=;i--)
d[i]-=d[i-],ans+=max(,d[i]);
for (i=;i<=n;i++){
if (d[i]<-) c[-d[i]]++;
else if (d[i]>){
if (d[i]==){
if (c[]) c[]--,ans--,c[]++;
}
else if (d[i]==){
if(c[]) c[]--,ans-=;
else if (c[]) c[]--,ans--;
}
}
}
printf("%d\n",ans);
l--;
}
}