Problem: Given are an integer N and arrays S, T, U, and V, each of length N. Construct an N×N matrix a that satisfy the following conditions:

* a_{i,j} is an integer.
* 0 \leq a_{i,j} \lt 2^{64}.
* If S_{i} = 0, the bitwise AND of the elements in the i-th row is U_{i}.
* If S_{i} = 1, the bitwise OR of the elements in the i-th row is U_{i}.
* If T_{i} = 0, the bitwise AND of the elements in the i-th column is V_{i}.
* If T_{i} = 1, the bitwise OR of the elements in the i-th column is V_{i}.



However, there may be cases where no matrix satisfies the conditions.

Constraints

* All values in input are integers.
* 1 \leq N \leq 500
* 0 \leq S_{i} \leq 1
* 0 \leq T_{i} \leq 1
* 0 \leq U_{i} \lt 2^{64}
* 0 \leq V_{i} \lt 2^{64}

Input

Input is given from Standard Input in the following format:


N
S_{1} S_{2} ...  S_{N}
T_{1} T_{2} ...  T_{N}
U_{1} U_{2} ...  U_{N}
V_{1} V_{2} ...  V_{N}


Output

If there exists a matrix that satisfies the conditions, print one such matrix in the following format:


a_{1,1} ...  a_{1,N}
:
a_{N,1} ...  a_{N,N}


Note that any matrix satisfying the conditions is accepted.

If no matrix satisfies the conditions, print -1.

Examples

Input

2
0 1
1 0
1 1
1 0


Output

1 1
1 0


Input

2
1 1
1 0
15 15
15 11


Output

15 11
15 11

Solution (in CPP):

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

using ul=unsigned long long;
int s[500],t[500],tmp[500][500],S[500],T[500],n,bit=-1,IN;
ul ans[500][500],u[500],v[500];

template<typename T>
void fin(T a){
  cout<<a<<endl;
  exit(0);
}

struct P{int va,idx,ve,ne,al;};
bool operator <(const P &a,const P &b){return a.va<b.va;};
priority_queue<P> que;

#define REP(i,n) for(int i=0;i<n;i++)
#define F(va) {\
  if(!~tmp[i][j]){\
    ans[i][j]+=((ul)1<<bit)*(tmp[i][j]=va);\
    S[i]++,T[j]++;\
    if(IN){\
      if(S[i]<n)que.push({S[i],i,'S',s[i]});\
      if(T[j]<n)que.push({T[j],j,'T',t[j]});\
    }\
  }\
}
void AL(){
  bool KO=1;
  while(KO){
    KO=0;
    REP(i,n)
      if(s[i]==((u[i]>>bit)&1)){
        bool f=0;
        REP(j,n)f|=tmp[i][j]==s[i];
        if(f)REP(j,n){KO|=tmp[i][j]<0;F(s[i]^1);}
      }
    REP(j,n)
      if(t[j]==((v[j]>>bit)&1)){
        bool f=0;
        REP(i,n)f|=tmp[i][j]==t[j];
        if(f)REP(i,n){KO|=tmp[i][j]<0;F(t[j]^1);}
      }
  }
}
bool same(int a,int b,int c,int d){return a==b&&b==c&&c==d;}

int main(){
  cin>>n;
  REP(i,n)cin>>s[i];
  REP(i,n)cin>>t[i];
  REP(i,n)cin>>u[i];
  REP(i,n)cin>>v[i];
  while(++bit<64){
    memset(tmp,-1,sizeof(tmp));
    memset(S,0,sizeof(S));
    memset(T,0,sizeof(T));
    IN=0;
    REP(i,n)if(s[i]^((u[i]>>bit)&1))REP(j,n)F(s[i]^1);
    REP(j,n)if(t[j]^((v[j]>>bit)&1))REP(i,n)F(t[j]^1);
    REP(i,n)REP(j,n)if(same(s[i],(u[i]>>bit)&1,t[j],(v[j]>>bit)&1))F(s[i]);
    AL();
    IN=1;
    REP(i,n)if(S[i]<n)que.push({S[i],i,'S',s[i],1});
    REP(j,n)if(T[j]<n)que.push({T[j],j,'T',t[j],1});
    while(que.size()){
      P p=que.top();que.pop();
      if(p.ve=='S'){
        int i=p.idx;
        if(p.va<S[i])continue;
        REP(j,n)
          if(!~tmp[i][j]){
            F(p.ne);
            p.ne^=p.al;p.al=0;
          }
        AL();
      }
      else{
        int j=p.idx;
        if(p.va<T[j])continue;
        REP(i,n)
          if(!~tmp[i][j]){
            F(p.ne);
            p.ne^=p.al;p.al=0;
          }
        AL();
      }
    }
  }

  REP(i,n){
    ul A=ans[i][0];
    REP(j,n)
      if(s[i])A|=ans[i][j];
      else A&=ans[i][j];
    if(A!=u[i])fin(-1);
  }
  REP(j,n){
    ul A=ans[0][j];
    REP(i,n)
      if(t[j])A|=ans[i][j];
      else A&=ans[i][j];
    if(A!=v[j])fin(-1);
  }

  REP(i,n){
    REP(j,n)cout<<ans[i][j]<<" ";cout<<endl;
  }
}