#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>
#include <random>

#define LEN(x) (long long)(x.size())
#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
bool is_bit_on(const unsigned long long bit, const unsigned int i) { return (bit >> i) & 1u; }
unsigned long long bit_set(const unsigned long long bit, const unsigned int i, const unsigned int b) {
    assert(b == 0 or b == 1);
    if (b == 0) { return bit & ~(1ull << i); }
    else        {return bit | (1ull << i); }
}

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}


bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}


long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}


long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}


long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 60u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

vector<unsigned long long> S, T, U, V;
vector<vector<int>> solve(const unsigned int bit) {
    int N = LEN(S);
    auto ans = make_v<int>(N, N);
    fill_v(ans, -1);

    // 確定を埋める
    {
        FOR(y, 0, N) {
            // 行のandは1なので全部1
            if (S[y] == 0 and is_bit_on(U[y], bit)) {
                FOR(x, 0, N) {
                    ans[y][x] = 1;
                }
            }
            // 行のorは0なので全部0
            else if (S[y] == 1 and not is_bit_on(U[y], bit)) {
                FOR(x, 0, N) {
                    ans[y][x] = 0;
                }
            }
        }

        FOR(x, 0, N) {
            // 列のandは1なので全部1
            if (T[x] == 0 and is_bit_on(V[x], bit)) {
                FOR(y, 0, N) {
                    if (ans[y][x] == 0) {
                        return {};
                    }
                    ans[y][x] = 1;
                }
            }
            // 列のorは0なので全部0
            else if (T[x] == 1 and not is_bit_on(V[x], bit)) {
                FOR(y, 0, N) {
                    if (ans[y][x] == 1) {
                        return {};
                    }
                    ans[y][x] = 0;
                }
            }
        }
    }

    FOR(_, 0, 2) {
        // 行を埋める
        {
            FOR(y, 0, N) {
                int z = 0, o = 0, q = 0;
                int q_idx = -1;
                FOR(x, 0, N) {
                    z += ans[y][x] == 0;
                    o += ans[y][x] == 1;
                    q += ans[y][x] == -1;
                    if (ans[y][x] == -1) {
                        q_idx = x;
                    }
                }

                // 行のandは0なので，0が1個以上必要
                if (S[y] == 0 and not is_bit_on(U[y], bit)) {
                    if (z > 0) {
                        continue;
                    }
                    if (q == 0) {
                        return {};
                    }
                    // 埋めるところは1箇所しかないので0で確定
                    if (q == 1) {
                        ans[y][q_idx] = 0;
                    }
                }
                    // 行のorは1なので，1が1個以上必要
                else if (S[y] == 1 and is_bit_on(U[y], bit)) {
                    if (o > 0) {
                        continue;
                    }
                    if (q == 0) {
                        return {};
                    }
                    // 埋めるところは1箇所しかないので1で確定
                    if (q == 1) {
                        ans[y][q_idx] = 1;
                    }
                }
            }
        }

        // 列を埋める
        {
            FOR(x, 0, N) {
                int z = 0, o = 0, q = 0;
                int q_idx = -1;
                FOR(y, 0, N) {
                    z += ans[y][x] == 0;
                    o += ans[y][x] == 1;
                    q += ans[y][x] == -1;
                    if (ans[y][x] == -1) {
                        q_idx = y;
                    }
                }

                // 列のandは0なので0が1個以上必要
                if (T[x] == 0 and not is_bit_on(V[x], bit)) {
                    if (z > 0) {
                        continue;
                    }
                    if (q == 0) {
                        return {};
                    }
                    // 埋めるところは1箇所しかないので0で確定
                    if (q == 1) {
                        ans[q_idx][x] = 0;
                    }
                }
                    // 列のorは1なので，1が1個以上必要
                else if (T[x] == 1 and is_bit_on(V[x], bit)) {
                    if (o > 0) {
                        continue;
                    }
                    if (q == 0) {
                        return {};
                    }
                    // 埋めるところは1箇所しかないので1で確定
                    if (q == 1) {
                        ans[q_idx][x] = 1;
                    }
                }
            }
        }
    }
    // チェス柄に埋める
    int a = 0;
    FOR(y, 0, N) {
        bool found = false;
        int b = 0;
        FOR(x, 0, N) {
            if (ans[y][x] == -1) {
                found = true;
                if ((a + b) % 2 == 0) {
                    ans[y][x] = 0;
                }
                else {
                    ans[y][x] = 1;
                }
                b++;
            }
        }
        if (found) {
            a++;
        }
    }

    return ans;
}

bool check(vector<vector<unsigned long long>> &ans) {
    int N = LEN(ans[0]);
    FOR(y, 0, N) {
        unsigned long long a = ans[y][0], b = ans[y][0];
        FOR(x, 1, N) {
            a &= ans[y][x];
            b |= ans[y][x];
        }

        if (S[y] == 0 and U[y] != a) {
            return false;
        }
        if (S[y] == 1 and U[y] != b) {
            return false;
        }
    }

    FOR(x, 0, N) {
        unsigned long long a = ans[0][x], b = ans[0][x];
        FOR(y, 1, N) {
            a &= ans[y][x];
            b |= ans[y][x];
        }

        if (T[x] == 0 and V[x] != a) {
            return false;
        }
        if (T[x] == 1 and V[x] != b) {
            return false;
        }
    }

    return true;
}

int main(int argc, char *argv[]) {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;

    S.resize(N);
    T.resize(N);
    U.resize(N);
    V.resize(N);
    FOR(i, 0, N) {
        cin >> S[i];
    }
    FOR(i, 0, N) {
        cin >> T[i];
    }
    FOR(i, 0, N) {
        cin >> U[i];
    }
    FOR(i, 0, N) {
        cin >> V[i];
    }

    auto ans = make_v<unsigned long long>(N, N);
    FOR(b, 0, 64) {
        auto t = solve(b);
        if (t.empty()) {
            print(-1);
            return 0;
        }
        FOR(y, 0, N) {
            FOR(x, 0, N) {
                ans[y][x] = bit_set(ans[y][x], b, t[y][x]);
            }
        }
    }

    if (check(ans)) {
        print(ans);
    }
    else {
        print(-1);
    }

    return 0;
}

Measured memory_bytes: 7788