#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
using namespace std;
void solve();
using ll = long long;
template <class T = ll>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ll ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr ll TEN(int n) {
  ll ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}
template <typename T>
void die(T x) {
  out(x);
  exit(0);
}

#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

#pragma endregion

constexpr long long MOD = /** 1000000007;  //*/ 998244353;

int ans[64][512][512];
using u64 = uint64_t;

void solve() {
  ini(N);
  vs S(N), T(N);
  V<u64> U(N), V(N);
  in(S, T, U, V);

  rep(i, N) S[i] = S[i] == "1" ? "or" : "and";
  rep(i, N) T[i] = T[i] == "1" ? "or" : "and";

  trc(S, U);
  trc(T, V);

  // S,U T,V
  auto ok = [&](int id) {
    rep(i, N) {
      int c = (S[i] == "or" ? 0 : 1);
      rep(j, N) {
        if (S[i] == "or")
          c |= ans[id][i][j];
        else
          c &= ans[id][i][j];
      }
      if (getbit(U[i], id) != c) return false;
    }
    rep(j, N) {
      int c = (T[j] == "or" ? 0 : 1);
      rep(i, N) {
        if (T[j] == "or")
          c |= ans[id][i][j];
        else
          c &= ans[id][i][j];
      }
      if (getbit(V[j], id) != c) return false;
    }
    return true;
  };

  rep(id, 64) {
    vi unusei, unusej;
    rep(i, N) {
      if (S[i] == "and" and getbit(U[i], id) == 1) {
        rep(j, N) ans[id][i][j] = 1;
      } else if (S[i] == "or" and getbit(U[i], id) == 0) {
        rep(j, N) ans[id][i][j] = 0;
      } else
        unusei.pb(i);
    }

    rep(j, N) {
      if (T[j] == "and" and getbit(V[j], id) == 1) {
        rep(i, N) ans[id][i][j] = 1;
      } else if (T[j] == "or" and getbit(V[j], id) == 0) {
        rep(i, N) ans[id][i][j] = 0;
      } else
        unusej.pb(j);
    }

    trc(id, unusei, unusej);
#ifdef NyaanDebug
    rep(i, N) trca(ans[id][i], N);
#endif

    rep(i, sz(unusei)) rep(j, sz(unusej)) {
      ans[id][unusei[i]][unusej[j]] = (i + j) & 1;
    }
    if (ok(id)) continue;
    rep(i, sz(unusei)) rep(j, sz(unusej)) {
      ans[id][unusei[i]][unusej[j]] = (i + j + 1) & 1;
    }
    if (ok(id)) continue;
    rep(i, sz(unusei)) rep(j, sz(unusej)) {
      ans[id][unusei[i]][unusej[j]] = 0;
    }
    if (ok(id)) continue;
    rep(i, sz(unusei)) rep(j, sz(unusej)) {
      ans[id][unusei[i]][unusej[j]] = 1;
    }
    if (ok(id)) continue;
    die("-1");
  }

  rep(i, N) {
    rep(j, N) {
      if (j) cout << " ";
      u64 bns = 0;
      rep(id, 64) {
        if (ans[id][i][j]) bns |= (1uLL << id);
      }
      cout << bns;
    }
    cout << "\n";
  }
}

Measured memory_bytes: 69892