/// Brrrr Brrrr
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

// order_of_key(k): returns the number of elements in the set strictly less than k
// find_by_order(k): returns an iterator to the k-th element (zero-based) in the set





#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};
int grid1[2][N];
int grid2[2][N];

void doWork() {

    int n;
    cin >> n;
    vector<int> go1[2], go2[2];
    f(i,0,2)
    f(j,0,n)    cin >> grid1[i][j];
    f(i,0,2)
    f(j,0,n)    cin >> grid2[i][j];

    vector<vector<int>> go(n + 1);
    map<ii, int> mp;
    vector<int> cnt(n + 1);
    int ptr = 0;
    vector<int> vec;

    for(int i = 0; i < n; i++) {
        if(i&1)swap(grid1[0][i], grid1[1][i]);
        int x = grid1[0][i], y = grid1[1][i];
        if(!mp.count({x,y})) mp[{x,y}] = ++ptr;
        go[mp[{x,y}]].pb(i);
    }
    for(int i = 0; i < n; i++) {
        if(i&1)swap(grid2[0][i], grid2[1][i]);
        int x = grid2[0][i], y = grid2[1][i];
        if(cnt[mp[{x,y}]] >= go[mp[{x,y}]].size()) {
            cout << "-1\n";
            return;
        }
        vec.push_back(go[mp[{x,y}]][cnt[mp[{x,y}]]]);
        cnt[mp[{x,y}]]++;
    }

    ordered_set st;

    ll ans = 0;
    for(int i = 0; i < n; i++) {
        ans += i - st.order_of_key(vec[i]+1);
        st.insert(vec[i]);
    }

    cout << ans << '\n';


}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}

///Look at my code ya codeomk