#include <bits/stdc++.h>
using namespace std;
int n;
unsigned long long a[200200], b[200200], c[200200];
map<int, int> cnt;
int main(void) {
  unsigned long long tmp, sum = 0, tb, tc, p2[35];
  int tmax = -1;
  cin >> n;
  for (register int i = 1; i <= n; i++) {
    cin >> b[i];
    sum += b[i];
  }
  for (register int i = 1; i <= n; i++) {
    cin >> c[i];
    if (c[i] < b[i]) {
      cout << -1;
      return 0;
    }
    sum += c[i];
  }
  if (sum % (2 * n) == 0)
    sum /= 2 * n;
  else {
    cout << -1;
    return 0;
  }
  for (register int i = 1; i <= n; i++) {
    tmp = b[i] + c[i] - sum;
    if (tmp % n == 0)
      tmp = a[i] = tmp / n;
    else {
      cout << -1;
      return 0;
    }
    int tnt = 0;
    while (tmp) {
      if (tmp & 1) cnt[tnt]++;
      tnt++;
      tmp >>= 1;
    }
    if (tnt > tmax) tmax = tnt;
  }
  for (register int i = 0; i <= tmax; i++) p2[i] = pow(2, i);
  for (register int i = 1; i <= n; i++) {
    tmp = a[i];
    tb = tc = 0;
    int tnt = 0;
    while (tmp) {
      if (tmp & 1) {
        tb += cnt[tnt] * p2[tnt];
        tc += n * p2[tnt];
      } else
        tc += cnt[tnt] * p2[tnt];
      tnt++;
      tmp >>= 1;
    }
    for (; tnt <= tmax; tnt++) tc += cnt[tnt] * p2[tnt];
    if (tb != b[i] || tc != c[i]) {
      cout << -1;
      return 0;
    }
  }
  for (register int i = 1; i <= n; i++) cout << a[i] << ' ';
  return 0;
}
