#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<string> v(n);
        indexed_set x;
        for(int i = 0; i < n; i++) {
            cin >> v[i];
        }
        int cur = 1;
        map<string, int> id;
        for(int i = 0; i < n; i++) {
            string s;
            cin >> s;
            id[s] = cur++;
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            ans += x.size() - x.order_of_key(id[v[i]]);
            x.insert(id[v[i]]);
        }
        cout << ans << "\n";
    }
    return 0;
}