#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=500010;
int t,n,a[N],b[N],c[N],fw[N],hd[N];
ll ans;
vector <int> v[N];
map <pair<int,int>,int> mp;
void modify (int x) {
	for (int i=x;i<=n;i+=(i&(-i))) {fw[i]++;}
}
int query (int x) {
	int res=0;
	for (int i=x;i;i-=(i&(-i))) {res+=fw[i];}
	return res;
}
int main () {
	scanf("%d",&t);
	for (int ii=1;ii<=t;ii++) {
		scanf("%d",&n);
		for (int i=1;i<=n;i++) {scanf("%d",&a[i]);fw[i]=0;}
		int tot=0;
		for (int i=1;i<=n;i++) {
			scanf("%d",&b[i]);
			if (i&1) {swap(a[i],b[i]);}
			if (mp.find(make_pair(a[i],b[i]))==mp.end()) {mp[make_pair(a[i],b[i])]=++tot;hd[tot]=0;v[tot].clear();}
			v[mp[make_pair(a[i],b[i])]].push_back(i);
		}
		for (int i=1;i<=n;i++) {scanf("%d",&a[i]);}
		int flg=1;
		for (int i=1;i<=n;i++) {
			scanf("%d",&b[i]);
			if (i&1) {swap(a[i],b[i]);}
			if (mp.find(make_pair(a[i],b[i]))==mp.end()) {flg=0;continue;}
			int tmp=mp[make_pair(a[i],b[i])];
			if (hd[tmp]>=v[tmp].size()) {flg=0;continue;}
			c[i]=v[tmp][hd[tmp]++];
		}
		if (!flg) {printf("-1\n");continue;}
		for (int i=1;i<=n;i++) {
			ans+=i-1-query(c[i]);
			modify(c[i]);
		}
		printf("%lld\n",ans);
	}
	return 0;
}