quadraples whose xor is 0

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string,int> psi;
typedef unordered_map<int,int> mii;
typedef unordered_map<long long,long long> mll;
typedef unordered_map<string,int> msi;
typedef unordered_map<char,int> mci;
typedef unordered_set<int> si;
typedef unordered_set<long long> sll;
typedef unordered_set<string> ss;
typedef unordered_set<char> sc;
typedef map<int,int> ormii;
typedef map<long long,long long> ormll;
typedef map<string,int> ormsi;
typedef map<char,int> ormci;
typedef set<int> orsi;
typedef set<long long> orsll;
typedef set<string> orss;
typedef set<char> orsc;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;

#define FOR(i, a, b) for (auto i=a; i<=(b); i++)
#define FORd(i,b,a) for (int i =b; i >= a; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define ins insert

const int MOD = 1000000007;
//type functions here



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc=1;
    cin>>tc;
    FOR(w,1,tc)
    {
      vi A,B,C,D;
       int n;
        cin>>n;
        FOR(i,1,n)
        {
            int temp;
            cin>>temp;
            A.pb(temp);
        }
        FOR(i,1,n)
        {
            int temp;
            cin>>temp;
            B.pb(temp);
        }
        FOR(i,1,n)
        {
            int temp;
            cin>>temp;
            C.pb(temp);
        }
        FOR(i,1,n)
        {
            int temp;
            cin>>temp;
            D.pb(temp);
        }
      si s1,s2;
      for(auto x:A)
      {
          for(auto y:B)
          {
              s1.insert(x^y);
          }
      }
      for(auto x:C)
      {
          for(auto y:D)
          {
              s2.insert(x^y);
          }
      }
      int count=0;
      for(auto x:s1)
      {
         if(s2.find(x^0)!=s2.end()) count++;

      }
      cout <<count<<endl;

    }
    return 0;
}