#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n;i>=1;i--)
#define mp make_pair
#define pb push_back
#define N 510000
int a[2][N],b[2][N],A[N],B[N];
vector<int> pos1[N],pos2[N];
int q[N];
map<pair<int,int>,int> dic;
int n;
int st[N];
int lowbit(int x)
{
	return x & (-x);
}
int getsum(int x)
{
	int ret=0;
	while (x)
	{
		ret+=st[x];
		x-=lowbit(x);
	}
	return ret;
}
void insert(int x,int k)
{
	while (x<=n)
	{
		st[x]+=k;
		x+=lowbit(x);
	}
}
int main()
{
	int T;
	cin>>T;
	while (T--)
	{
		scanf("%d",&n);
		rep(i,n)scanf("%d",&a[0][i]);
		rep(i,n)scanf("%d",&a[1][i]);
		rep(i,n)scanf("%d",&b[0][i]);
		rep(i,n)scanf("%d",&b[1][i]);
		rep(i,n)if (i%2==0)swap(a[0][i],a[1][i]);
		rep(i,n)if (i%2==0)swap(b[0][i],b[1][i]);
		dic.clear();
		int tot=0;
		for(int i=1;i<=n;i++)
		{
			if (dic.find(mp(a[0][i],a[1][i]))==dic.end())dic[mp(a[0][i],a[1][i])]=++tot;
			A[i]=dic[mp(a[0][i],a[1][i])];
		}
		//rep(i,n)cout<<A[i]<<" "; puts("");
		int flag=1;
		for(int i=1;i<=n;i++)
		{
			if (dic.find(mp(b[0][i],b[1][i]))==dic.end())
			{
				flag=0;
				break;
			}
			B[i]=dic[mp(b[0][i],b[1][i])];
		}
		//rep(i,n)cout<<B[i]<<" "; puts("");
		if (!flag){ puts("-1"); continue; }
		for(int i=1;i<=tot;i++)pos1[i].clear(),pos2[i].clear();
		for(int i=1;i<=n;i++)pos1[A[i]].pb(i),pos2[B[i]].pb(i);
		for(int i=1;i<=n;i++)
		{
			if (pos1[i].size()!=pos2[i].size()){ flag=0; break; }
			int cnt=pos1[i].size();
			for(int j=0;j<cnt;j++)q[pos1[i][j]]=pos2[i][j];
		}
		if (!flag){ puts("-1"); continue; }
		long long ans=0;
		for(int i=1;i<=n;i++)st[i]=0;
		for(int i=1;i<=n;i++)
		{
			ans=ans+i-1-getsum(q[i]);
			insert(q[i],1);
		}
		printf("%lld\n",ans);
	}
	return 0;
}