#include <bits/stdc++.h>
using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int MN = 2005;
int n;
int arr[2][MN], brr[2][MN];
pii pos[MN*2], tgt[MN*2];
vector<pair<pii, pii>> ans;

void doSwap(int a, int b){
    auto [x1, y1] = pos[a];
    auto [x2, y2] = pos[b];
    assert(arr[x1][y1] > arr[x1^1][y1] && arr[x2][y2] ^ arr[x2^1][y2]);
    ans.pb({pos[a], pos[b]});
    swap(arr[x1][y1], arr[x2][y2]);
    swap(pos[a], pos[b]);
}

bool solve(){
    cin >> n;
    FR(i, 2) FR(j, n) cin >> arr[i][j], pos[--arr[i][j]] = {i, j};
    FR(i, 2) FR(j, n) cin >> brr[i][j], tgt[--brr[i][j]] = {i, j};

    FR(a, n+n){
        if(pos[a] == tgt[a]) continue;
        auto [x1, y1] = pos[a];
        if(a < arr[x1^1][y1]) return false;

        auto [x2, y2] = tgt[a];
        if(arr[x2][y2] > arr[x2^1][y2]){
            doSwap(a, arr[x2][y2]);
            continue;
        }

        FOR(b, a+1, arr[x2][y2]){
            auto [x3, y3] = pos[b];
            if(b < arr[x3^1][y3]) continue;
            doSwap(arr[x2^1][y2], b);
            doSwap(a, arr[x2][y2]);
            goto loopEnd;
        }

        return false;
        loopEnd:;
    }

    return true;
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--){
        bool res = solve();
        if(res){
            cout << SZ(ans) << '\n';
            for(auto [p1, p2] : ans){
                auto [a, b] = p1;
                auto [c, d] = p2;
                cout << a+1 << ' ' << b+1 << ' ' << c+1 << ' ' << d+1 << '\n';
            }
        }
        else cout << "-1\n";

        ans.clear();
    }
}