#include "bits/stdc++.h"

using namespace std;

#define fwd(i,a,b) for(int i=(a); i<(b);i++)
#define ford(i,a,b) for(int i=(a); i>(b);i--)
#define foreach(i,v) for(auto& (i) : (v))
#define rep(i,n) fwd(i,0,n)

vector<int> A, B, C, D;
map<pair<int, int>, vector<int>> M, N;
int n;

void solve() {
    rep(i, n) {
        if (i & 1) {
            M[{A[i], B[i]}].emplace_back(i);
        } else {
            M[{B[i], A[i]}].emplace_back(i);
        }
    }
    rep(i, n) {
        if (i & 1) {
            N[{C[i], D[i]}].emplace_back(i);
        } else {
            N[{D[i], C[i]}].emplace_back(i);
        }
    }

    long long ans = 0;

    for (const auto &[x, C]: M) {
        int a = x.first, b = x.second;
        vector<int> V = N[{a,b}];
        if(C.size() != V.size()) {
            cout << "-1\n"; return;
        }
        for(int i = 0 ; i < (int)C.size() ; ++i) {
            ans += abs(C[i]-V[i]);
        }
    }
    cout << ans/2 << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);

    int t;
    cin >> t;
    while(t--) {
        cin >> n;
        A = B = C = D = vector<int>(n);
        rep(i, n) cin >> A[i];
        rep(i, n) cin >> B[i];
        rep(i, n) cin >> C[i];
        rep(i, n) cin >> D[i];
        solve();
    }

    return 0;
}