#include <bits/stdc++.h>
using namespace std;
void In() { freopen("in.in", "r", stdin); }
void Out() { freopen("out.out", "w", stdout); }
const int N = 2e5 + 10;
const int M = 3e5 + 10;
const int Mbit = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
int n;
long long suma, sumd;
long long a[N], b[N], c[N], d[N], base[40];
int B[N][40], C[N][40], k[N];
int main() {
  base[0] = 1;
  for (int i = 1; i <= 32; i++) base[i] = base[i - 1] * 2;
  while (~scanf("%d", &n)) {
    for (int i = 1; i <= n; i++) scanf("%lld", &b[i]);
    for (int i = 1; i <= n; i++) scanf("%lld", &c[i]);
    sumd = 0;
    for (int i = 1; i <= n; i++) d[i] = b[i] + c[i], sumd += d[i];
    suma = sumd / 2 / n;
    for (int i = 1; i <= n; i++) a[i] = (d[i] - suma) / n;
    for (int i = 0; i <= 32; i++) {
      long long x = 1ll << i;
      for (int j = 1; j <= n; j++)
        if (a[j] & x) k[i]++;
    }
    for (int i = 0; i <= 32; i++) {
      long long x = 1ll << i;
      for (int j = 1; j <= n; j++)
        if (a[j] & x) {
          B[j][i] = k[i];
          C[j][i] = n;
        } else {
          B[j][i] = 0;
          C[j][i] = k[i];
        }
    }
    bool flag = 1;
    for (int i = 1; i <= n; i++) {
      long long res = 0;
      for (int j = 0; j <= 32; j++) res = res + B[i][j] * base[j];
      if (res != b[i]) {
        flag = 0;
        break;
      }
      res = 0;
      for (int j = 0; j <= 32; j++) res = res + C[i][j] * base[j];
      if (res != c[i]) {
        flag = 0;
        break;
      }
    }
    if (!flag)
      puts("-1");
    else {
      for (int i = 1; i <= n; i++)
        printf("%lld%c", a[i], (i == n) ? '\n' : ' ');
    }
  }
  return 0;
}
