#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int* a = new int[n];
  int* b = new int[n];
  int* c = new int[n];
  int* d = new int[n];
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    d[i] = b[i] + c[i];
    sum += d[i];
  }
  sum /= (2 * n);
  for (int i = 0; i < n; i++) {
    a[i] = (d[i] - sum) / n;
  }
  for (int i = 0; i < n; i++) {
    if (a[i] < 0) {
      cout << -1 << endl;
      return;
    }
  }
  const int max_int_bits = 32;
  int bits[max_int_bits][n];
  for (int i = 0; i < max_int_bits - 1; i++) {
    for (int j = 0; j < n; j++) {
      if ((a[j] & (1LL << i)) == 0)
        bits[i][j] = 0;
      else
        bits[i][j] = 1;
    }
  }
  int* kbits = new int[max_int_bits - 1];
  memset(kbits, 0, sizeof(int) * (max_int_bits - 1));
  for (int i = 0; i < max_int_bits - 1; i++) {
    for (int j = 0; j < n; j++) {
      kbits[i] += bits[i][j];
    }
  }
  int* b1 = new int[n];
  int* c1 = new int[n];
  memset(b1, 0, sizeof(int) * n);
  memset(c1, 0, sizeof(int) * n);
  for (int i = 0; i < max_int_bits - 1; i++) {
    for (int j = 0; j < n; j++) {
      if (bits[i][j] == 0) {
        b1[j] += 0;
        c1[j] += (kbits[i] << i);
      } else {
        b1[j] += (kbits[i] << i);
        c1[j] += (n << i);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (b1[i] != b[i] || c1[i] != c[i]) {
      cout << -1 << endl;
      return;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
int main() {
  solve();
  return 0;
}
