// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

int32_t main() {
    using uint = uint64_t;
    int n; cin >> n;
    vector<uint> s(n),t(n),u(n),v(n);
    cin >> s >> t >> u >> v;

    const int LG = 64, TEST = 1;
    const uint AND = 0, OR = 1;
    auto ans = make_v<uint,2>(n,n);
    rep (k,LG) {
        vector<int> AND_0_x, OR_1_x;
        vector<int> AND_0_y, OR_1_y;

        auto cnt_x = make_v<int,2>(2,2);
        auto cnt_y = make_v<int,2>(2,2);
        rep (i,n) {
            cnt_x[s[i]][u[i]>>k&1]++;
            cnt_y[t[i]][v[i]>>k&1]++;
            if (s[i] == AND && (u[i]>>k&1) == 0) AND_0_x.eb(i);
            if (t[i] == AND && (v[i]>>k&1) == 0) AND_0_y.eb(i);
            if (s[i] == OR  && (u[i]>>k&1) == 1) OR_1_x.eb(i);
            if (t[i] == OR  && (v[i]>>k&1) == 1) OR_1_y.eb(i);
        }
        if (k < TEST) dump(cnt_x,cnt_y);

        rep (i,n) rep (j,n) {
            auto p = mp(s[i],int32_t(u[i]>>k&1));
            auto q = mp(t[j],int32_t(v[j]>>k&1));
            int val = 0;
            if (p == mp(AND,1) && q == mp(OR ,0)) quit(-1);
            if (p == mp(OR ,0) && q == mp(AND,1)) quit(-1);
            if (p == mp(AND,0) && q == mp(OR ,1)) continue;
            if (p == mp(OR ,1) && q == mp(AND,0)) continue;
            if (p == mp(AND,1) || q == mp(AND,1)) val = 1;
            if (p == mp(OR ,0) || q == mp(OR ,0)) val = 0;
            if (p == mp(AND,0) && q == mp(AND,0)) val = 0;
            if (p == mp(OR ,1) && q == mp(OR ,1)) val = 1;
            ans[i][j] |= val<<k;
        }

        if (k < TEST) {
            dump(AND_0_x);
            dump(OR_1_y);
        }
        int val = 0;
        if (cnt_x[AND][1] == 0 && cnt_x[OR ][1] == 0) val = 1;
        rep (a,AND_0_x.size()) rep (b,OR_1_y.size()) {
            ans[AND_0_x[a]][OR_1_y[b]] |= (val^(a&1)^(b&1))<<k;
        }

        if (k < TEST) {
            dump(OR_1_x);
            dump(AND_0_y);
        }
        val = 0;
        if (cnt_y[AND][1] == 0 && cnt_y[OR ][1] == 0) val = 1;
        rep (a,OR_1_x.size()) rep (b,AND_0_y.size()) {
            ans[OR_1_x[a]][AND_0_y[b]] |= (val^(a&1)^(b&1))<<k;
        }
    }

    debug {
        rep (i,n) {
            rep (j,n) cerr << ans[i][j] << " ";
            cerr << "\n";
        }
    }

    //debug
    {
        rep (i,n) {
            if (s[i] == 0) {
                uint val = -1;
                rep (j,n) val &= ans[i][j];
                if (val != u[i]) {
                    dump(i,val,u[i]);
//                    assert(val == u[i]);
                    quit(-1);
                }
            } else {
                uint val = 0;
                rep (j,n) val |= ans[i][j];
                if (val != u[i]) {
                    dump(i,val,u[i]);
//                    assert(val == u[i]);
                    quit(-1);
                }
            }
        }
        rep (j,n) {
            if (t[j] == 0) {
                uint val = -1;
                rep (i,n) val &= ans[i][j];
                if (val != v[j]) {
                    dump(j,val,v[j]);
//                    assert(val == v[j]);
                    quit(-1);
                }
            } else {
                uint val = 0;
                rep (i,n) val |= ans[i][j];
                if (val != v[j]) {
                    dump(j,val,v[j]);
//                    assert(val == v[j]);
                    quit(-1);
                }
            }
        }
    }

    rep (i,n) {
        rep (j,n) cout << ans[i][j] << " ";
        cout << "\n";
    }
}


Measured memory_bytes: 7588