#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;cin>>x;return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>ostream& operator<<(ostream&o,const vv<T>&v){for(auto&r:v)o<<r<<'\n';return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T1,class T2>pair<T1,T2>operator*(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi*b.fi,a.se*b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>void operator+=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi+=b.fi;a.se+=b.se;}
template<class T1,class T2>void operator-=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi-=b.fi;a.se-=b.se;}
template<class T1,class T2>void operator*=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi*=b.fi;a.se*=b.se;}
template<class T>void operator*=(pair<T,T>&a,T b){a.fi*=b;a.se*=b;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T1,class T2>void operator%=(vc<T1>&a,T2 b){for(T1&x:a)x%=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T1,class T2>void prepend(vc<T1>&a,const T2&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { cout<<"-1"<<'\n'; return;}
#define yes { cout<<"Yes"<<'\n'; return;}
#define ye { cout<<"Yes"<<'\n';}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define endl '\n'

vc<map<int,int>> mp;
void init() {
  mp.resize(5);
  rep1(n,4) {
    int m = n*n;
    int m2 = 1<<m;
    rep(s,m2) {
      vvi a(n,vi(n));
      rep(i,n)rep(j,n) a[i][j] = s>>(i*n+j)&1;
      int t = 0;
      rep(i,n) {
        int x = 1; rep(j,n) x &= a[i][j];
        t = t<<1|x;
      }
      rep(j,n) {
        int x = 0; rep(i,n) x |= a[i][j];
        t = t<<1|x;
      }
      vi z(n*2-1);
      rep(i,n)rep(j,n) z[i+j] ^= a[i][j];
      rep(i,n*2-1) t = t<<1|z[i];
      mp[n][t] = s;
    }
  }
}

struct Solver {
  void solve() {
    int n;
    cin>>n;
    vi x(n), y(n), z(n*2-1);
    cin>>x>>y>>z;

    vvi ans(n,vi(n));
    if (n <= 4) {
      rep(k,30) {
        int t = 0;
        rep(i,n) t = t<<1|(x[i]>>k&1);
        rep(i,n) t = t<<1|(y[i]>>k&1);
        rep(i,n*2-1) t = t<<1|(z[i]>>k&1);
        if (!mp[n].count(t)) rtn(-1);
        int s = mp[n][t];
        rep(i,n)rep(j,n) ans[i][j] |= (s>>(i*n+j)&1)<<k;
      }
    } else {
      rep(k,30) {
        vvi a(n,vi(n));
        int flag = 0;
        rep(i,n) if (x[i]>>k&1) {
          rep(j,n) a[i][j] |= 2;
          flag |= 2;
        }
        rep(j,n) if (~y[j]>>k&1) {
          rep(i,n) a[i][j] |= 1;
          flag |= 1;
        }
        a[0][0] |= 1<<(z[0]>>k&1);
        a[n-1][n-1] |= 1<<(z.back()>>k&1);
        rep(i,n)rep(j,n) if (a[i][j] == 3) rtn(-1);
        a--;
        if (flag) {
          vi num(n,n);
          if (flag == 1) {
            rep(i,n)rep(j,n) a[i][j] = y[j]>>k&1;
          } else {
            rep(i,n)rep(j,n) a[i][j] = x[i]>>k&1;
          }
          vi nz(n*2-1);
          rep(i,n*2-1) nz[i] = z[i]>>k&1;
          rep(i,n)rep(j,n) nz[i+j] ^= a[i][j];
          rep(ij,n*2-1) if (nz[ij] && ij != n-1) {
            if (flag == 1) {
              rep(i,n) {
                int j = ij-i;
                if (j < 0 || j >= n) continue;
                if (y[j]>>k&1) { a[i][j] ^= 1; num[j]--; break;}
              }
            } else {
              rep(j,n) {
                int i = ij-j;
                if (i < 0 || i >= n) continue;
                if (~x[i]>>k&1) { a[i][j] ^= 1; num[i]--; break;}
              }
            }
          }
          if (nz[n-1]) {
            if (flag == 1) {
              drep(i,n) {
                int j = n-1-i;
                if (j < 0 || j >= n) continue;
                if ((y[j]>>k&1) && num[j] > 1) { a[i][j] ^= 1; num[j]--; break;}
              }
            } else {
              drep(j,n) {
                int i = n-1-j;
                if (i < 0 || i >= n) continue;
                if ((~x[i]>>k&1) && num[i] > 1) { a[i][j] ^= 1; num[i]--; break;}
              }
            }
          }
          rep(i,n) if (num[i] == 0) dame;
        } else {
          rep(i,n)rep(j,n) if (a[i][j] == -1) a[i][j] = (i+j)%2;
          vi b(n*2-1);
          rep(i,n)rep(j,n) b[i+j] ^= a[i][j];
          rep(ij,n*2-1) if (b[ij] != (z[ij]>>k&1)) {
            int i = ij-1, j = 1;
            if (ij >= 4) j++, i--;
            if (i >= n) j += i-n+1, i = n-1;
            a[i][j] ^= 1;
          }
        }
        rep(i,n)rep(j,n) ans[i][j] |= a[i][j]<<k;
      }
    }
    cout<<ans;
  }
};

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  init();
  int ts = 1;
  cin >> ts;
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}