#include <bits/stdc++.h>
using namespace std;
long long a[200009], b[200009], c[200009], k[64];
const long long one = 1;
int main() {
  int n;
  cin >> n;
  long long sum = 0;
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
    sum += b[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> c[i];
    sum += c[i];
  }
  int ans = 0;
  if (sum % (2 * n) != 0)
    ans = -1;
  else
    sum /= (2 * n);
  for (int i = 0; i < n; ++i) {
    if (ans == -1 || b[i] + c[i] < sum || (b[i] + c[i] - sum) % n != 0) {
      ans = -1;
      break;
    }
    a[i] = (b[i] + c[i] - sum) / n;
  }
  memset(k, 0, sizeof(k));
  for (int j = 0; j < 32; ++j) {
    for (int i = 0; i < n; ++i) {
      k[j] += ((a[i] >> j) & one);
    }
  }
  for (int i = 0; i < n; ++i) {
    long long bi = 0;
    long long ci = 0;
    for (int j = 0; j < 32; ++j) {
      if ((a[i] >> j) & one) {
        bi += k[j] * (one << j);
        ci += n * (one << j);
      } else {
        ci += k[j] * (1 << j);
      }
    }
    if (b[i] != bi || c[i] != ci) {
      ans = -1;
      break;
    }
  }
  if (ans == -1)
    cout << "-1" << endl;
  else {
    for (int i = 0; i < n; ++i) cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
