#include <bits/stdc++.h>
const int maxn = 2e5 + 10;
using namespace std;
long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); }
long long qpow(long long p, long long q) {
  long long f = 1;
  while (q) {
    if (q & 1) f = f * p;
    p = p * p;
    q >>= 1;
  }
  return f;
}
inline long long read() {
  long long x = 0;
  int f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, m, t;
long long a[maxn], b[maxn], c[maxn], d[maxn], k[maxn], num[30][maxn], sum;
bool flag;
int main() {
  int i, j;
  flag = true;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) b[i] = read();
  for (i = 1; i <= n; i++) c[i] = read();
  for (i = 1; i <= n; i++) d[i] = b[i] + c[i], sum += d[i];
  sum /= (2 * n);
  for (i = 1; i <= n; i++) a[i] = (d[i] - sum) / n;
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= 29; j++)
      if ((a[i] >> j) % 2 == 1) num[j][i] = 1, k[j]++;
  }
  for (i = 1; i <= n; i++) {
    long long tmp1 = 0, tmp2 = 0;
    for (j = 0; j <= 29; j++) {
      if (num[j][i])
        tmp1 += (1 << j) * k[j];
      else
        tmp2 += (1 << j) * k[j];
    }
    if (tmp1 != b[i] && tmp2 != c[i]) {
      flag = false;
      break;
    }
  }
  if (flag) {
    for (i = 1; i <= n; i++) printf("%lld ", a[i]);
  } else
    puts("-1");
  return 0;
}
