#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int n;
long long b[maxn], c[maxn], s, a[maxn], num[63];
bool check() {
  memset(num, 0, sizeof num);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < 63; ++j)
      if ((a[i] >> j) & 1) ++num[j];
  for (int i = 0; i < n; ++i) {
    long long B = 0;
    for (int j = 0; j < 63; ++j)
      if ((a[i] >> j) & 1) B += (1 << j) * num[j];
    if (B != b[i]) return false;
  }
  for (int i = 0; i < n; ++i) {
    long long C = 0;
    for (int j = 0; j < 63; ++j)
      if ((a[i] >> j) & 1)
        C += (1 << j) * n;
      else
        C += (1 << j) * num[j];
    if (C != c[i]) return false;
  }
  return true;
}
void solve() {
  if (s % (n << 1)) {
    puts("-1");
    return;
  }
  s /= (n << 1);
  for (int i = 0; i < n; ++i) {
    if (b[i] + c[i] - s < 0 || (b[i] + c[i] - s) % n) {
      puts("-1");
      return;
    }
    a[i] = (b[i] + c[i] - s) / n;
  }
  if (!check()) {
    puts("-1");
    return;
  }
  for (int i = 0; i < n; ++i) printf("%lld%c", a[i], i + 1 == n ? '\n' : ' ');
}
int main() {
  while (scanf("%d", &n) == 1) {
    s = 0;
    for (int i = 0; i < n; ++i) {
      scanf("%lld", &b[i]);
      s += b[i];
    }
    for (int i = 0; i < n; ++i) {
      scanf("%lld", &c[i]);
      s += c[i];
    }
    solve();
  }
  return 0;
}
