#include <bits/stdc++.h>
using namespace std;
bool chkmin(int &a, int b) { return b < a ? a = b, 1 : 0; }
bool chkmax(int &a, int b) { return b > a ? a = b, 1 : 0; }
inline long long read() {
  long long x = 0, fh = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fh = -1;
  for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ '0');
  return x * fh;
}
int a[200005], b[200005];
int c[200005], n;
int num[40];
int main() {
  n = read();
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) b[i] = read();
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) c[i] = read();
  long long sum = 0;
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) sum += b[i] + c[i];
  if (sum % n || sum % 2) {
    puts("-1");
    return 0;
  }
  int flag = 1;
  sum /= 2 * n;
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) {
    int tmp = b[i] + c[i] - sum;
    if (tmp % n) {
      flag = 0;
      break;
    }
    a[i] = tmp / n;
  }
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) {
    for (int j = (1), _end_ = (int)(32); j <= _end_; ++j) {
      if ((a[i] >> (j - 1)) & 1) num[j]++;
    }
  }
  for (int i = (1), _end_ = (int)(n); i <= _end_; ++i) {
    int sb = 0, sc = 0;
    for (int j = (1), _end_ = (int)(32); j <= _end_; ++j) {
      if ((a[i] >> (j - 1)) & 1) {
        sb += num[j] * (1 << (j - 1));
        sc += n * (1 << (j - 1));
      } else {
        sc += num[j] * (1 << (j - 1));
      }
    }
    if (sb != b[i] || sc != c[i]) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    for (int i = (1), _end_ = (int)(n); i <= _end_; ++i)
      printf("%d%c", a[i], i == n ? '\n' : ' ');
    return 0;
  }
  puts("-1");
  return 0;
}
