#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> pippi;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
int iinf=1<<30;
double pi=3.141592653589793238462643383279L;
double eps=1e-8;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
//#define endl "\n"
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<int,int,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    if(k<0)return 0;
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
struct SCC{
public:
    static const int MV=500000;
    vector<vector<int>> sc;
    int cmp[MV];
private:
    bool used[MV];
    vector<int> g[MV],rg[MV],vs;
    int V;
public:
    SCC(int n){
        V=n;
        rep(i,0,n){
            g[i].clear();
            rg[i].clear();
        }
    }
    void add(int from,int to){
        g[from].push_back(to);
        rg[to].push_back(from);
    }
    void dfs(int now){
        used[now]=true;
        rep(i,0,g[now].size()){
            int ne=g[now][i];
            if(!used[ne])dfs(ne);
        }
        vs.push_back(now);
    }
    void rdfs(int now,int k){
        used[now]=true;
        cmp[now]=k;
        sc[k].push_back(now);
        rep(i,0,rg[now].size()){
            int ne=rg[now][i];
            if(!used[ne])rdfs(ne,k);
        }
    }
    void scc(){
        fill(used,used+V,false);
        vs.clear();
        sc.clear();
        sc.resize(MV);
        rep(i,0,V){
            if(!used[i])dfs(i);
        }
        fill(used,used+V,false);
        int k=0;
        rrep(i,vs.size()-1,0){
            int ne=vs[i];
            if(!used[ne]){
                rdfs(ne,k);
                k++;
            }
        }
        sc.resize(k);
        
    }
};
//MVの指定!
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;cin>>n;
    SCC sc(2*n*n);
    int m=n*n;
    int s[n],t[n],u[n];
    rep(i,0,n)cin>>s[i];
    rep(i,0,n)cin>>t[i];
    rep(i,0,n)cin>>u[i];
    rep(i,0,n){
        s[i]--;
        t[i]--;
        rep(j,0,n){
            int f=s[i]*n+j,ss=j*n+t[i];
            if(u[i]==0){
                sc.add(m+f,ss);
                sc.add(m+ss,f);
            }
            else if(u[i]==1){
                sc.add(f,ss);
                sc.add(m+ss,m+f);
            }
            else if(u[i]==2){
                sc.add(m+f,m+ss);
                sc.add(ss,f);
            }
            else{
                sc.add(f,m+ss);
                sc.add(ss,m+f);
            }
        }
    }
    sc.scc();
    rep(i,0,m){
        if(sc.cmp[i]==sc.cmp[m+i]){
            cout<<-1<<endl;
            return 0;
        }
    }
    rep(i,0,m){
        int nh=i/n,nw=i%n;
        if(sc.cmp[i]>sc.cmp[i+m])cout<<1<<" ";
        else cout<<0<<" ";
        if(nw==n-1)cout<<endl;
    }
}