#include <bits/stdc++.h>
using namespace std;
long long int n;
long long int a[200007], b[200007], c[200007], d[200007];
long long int bb[200007], cc[200007];
long long int calc[35];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> b[i];
  for (int i = 0; i < n; i++) cin >> c[i];
  long long int sum(0);
  for (int i = 0; i < n; i++) {
    d[i] = b[i] + c[i];
    sum += d[i];
  }
  for (int i = 0; i < n; i++) {
    a[i] = (2 * n * d[i] - sum) / (2 * n * n);
    if ((2 * n * d[i] - sum) % (2 * n * n) != 0) {
      cout << -1 << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    long long int perm = a[i];
    long long int pos(0);
    while (perm) {
      calc[pos++] += (perm % 2);
      perm /= 2;
    }
  }
  for (int i = 0; i < n; i++) {
    long long int ci(0), bi(0);
    long long int base(1);
    for (int j = 0; j < 32; j++) {
      bi += ((a[i] & (1 << j)) != 0 ? calc[j] : 0) * base;
      ci += ((a[i] & (1 << j)) != 0 ? n : calc[j]) * base;
      base *= 2;
    }
    if (bi != b[i] || ci != c[i]) {
      cout << -1 << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << ' ';
  }
  cout << endl;
  return 0;
}
