#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 5e5 + 5;
int tt, n;
int a[4][N], t[N];
struct tree{
	int a[N];
	void add(int x, int k){
		for (; x <= n; x += x & -x)
			a[x] += k;
	}
	int ask(int x){
		int res = 0;
		for (; x; x -= x & -x)
			res += a[x];
		return res;
	}
}T;
map<pair<int, int>, vector<int>> mp1, mp2;
void solve(){
	mp1.clear(), mp2.clear();
	cin >> n;
	for (int i : {0, 1, 2, 3})
		for (int j = 1; j <= n; j++)
			cin >> a[i][j];
	for (int i = 1; i <= n; i++)
		mp1[{a[i & 1][i], a[(i & 1) ^ 1][i]}].push_back(i);
	for (int i = 1; i <= n; i++)
		mp2[{a[(i & 1) | 2][i], a[((i & 1) ^ 1) | 2][i]}].push_back(i);
	for (const pair<pair<int, int>, vector<int>> &p : mp1){
		vector<int> &vec = mp2[p.first];
		if (vec.size() != p.second.size()){
			cout << -1 << endl;
			return;
		}
		for (int i = 0; i < (int)p.second.size(); i++)
			t[p.second[i]] = vec[i];
	}
	memset(T.a, 0, sizeof(T.a));
	long long ans = 0;
	for (int i = n; i >= 1; i--){
		ans += T.ask(t[i]);
		T.add(t[i], 1);
	}
	cout << ans << endl;
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	freopen("in.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
	cin >> tt;
	while (tt--) solve();
	return 0;
}