import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

void main()
{
	auto N = RD;
	auto S = RDA!ulong;
	auto T = RDA!ulong;
	auto U = RDA!ulong;
	auto V = RDA!ulong;

	auto a = new ulong[][](N, N);
	foreach (i; 0..N)
	{
		if (S[i] != 0) continue;
		a[i][] |= U[i];
	}
	foreach (i; 0..N)
	{
		if (T[i] != 0) continue;
		foreach (j; 0..N)
			a[j][i] |= V[i];
	}

	bool ok = true;
	foreach (i; 0..N)
	{
		if (S[i] != 1) continue;
		ulong x;
		foreach (j; 0..N)
		{
			x |= a[i][j];
		}
		if ((U[i] | x) > U[i])
		{
			ok = false;
			break;
		}
		auto y = U[i] - x;
		foreach (j; 0..N)
		{
			foreach (k; 0..64)
			{
				auto bit = 1LU << k;
				if ((y & bit))
				{
					if (V[j] & bit)
					{
						a[i][j] |= bit;
						y -= bit;
					}
					else if (T[j] == 0)
					{
						bool ok2;
						foreach (l; 0..N)
						{
							if (l == i) continue;
							if ((a[l][j] & bit) == 0)
							{
								ok2 = true;
								break;
							}
						}
						if (ok2)
						{
							a[i][j] |= bit;
							y -= bit;
						}
					}
				}
			}
		}
		if (y != 0)
		{
			ok = false;
			break;
		}
	}
	foreach (i; 0..N)
	{
		if (T[i] != 1) continue;
		ulong x;
		foreach (j; 0..N)
		{
			x |= a[j][i];
		}
		if ((V[i] | x) > V[i])
		{
			ok = false;
			break;
		}
		auto y = V[i] - x;
		foreach (j; 0..N)
		{
			foreach (k; 0..64)
			{
				auto bit = 1LU << k;
				if ((y & bit))
				{
					if (U[j] & bit)
					{
						a[j][i] |= bit;
						y -= bit;
					}
					else if (S[j] == 0)
					{
						bool ok2;
						foreach (l; 0..N)
						{
							if (l == i) continue;
							if ((a[j][l] & bit) == 0)
							{
								ok2 = true;
								break;
							}
						}
						if (ok2)
						{
							a[j][i] |= bit;
							y -= bit;
						}
					}
				}
			}
		}
		if (y != 0)
		{
			ok = false;
			break;
		}
	}
	debug writeln(a);

	if (N == 1)
	{
		if (U[0] == V[0])
			writeln(U[0]);
		else
			writeln(-1);
	}
	else
	{
		if (ok)
		{
			foreach (i; 0..N)
				a[i].map!(to!string).join(" ").writeln;
		}
		else
		{
			writeln(-1);
		}
	}

	stdout.flush;
	debug readln;
}

Measured memory_bytes: 9392