#include <bits/stdc++.h>
using namespace std;
const int ND = 32;
int main(int argc, char* argv[]) {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> b(n);
  vector<int> c(n);
  vector<int> d(n);
  for (int i = 0; i < n; ++i) cin >> b[i];
  for (int i = 0; i < n; ++i) cin >> c[i];
  for (int i = 0; i < n; ++i) d[i] = b[i] + c[i];
  long long dsum = 0;
  for (int i = 0; i < n; ++i) dsum += d[i];
  long long asum = dsum / 2 / n;
  for (int i = 0; i < n; ++i) a[i] = (d[i] - (int)asum) / n;
  int num[ND];
  for (int i = 0; i < ND; ++i) {
    num[i] = 0;
    for (int j = 0; j < n; ++j) {
      if (a[j] & (1 << i)) ++num[i];
    }
  }
  vector<int> bt[ND];
  vector<int> ct[ND];
  for (int i = 0; i < ND; ++i) {
    bt[i].resize(n);
    ct[i].resize(n);
    for (int j = 0; j < n; ++j) {
      if (a[j] & (1 << i)) {
        bt[i][j] = num[i];
        ct[i][j] = n;
      } else {
        bt[i][j] = 0;
        ct[i][j] = num[i];
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    int curr_b = 0;
    int curr_c = 0;
    for (int j = 0; j < ND; ++j) {
      curr_b += (bt[j][i] << j);
      curr_c += (ct[j][i] << j);
    }
    if (b[i] != curr_b || c[i] != curr_c) {
      cout << -1 << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; ++i) cout << a[i] << " ";
  cout << endl;
  return 0;
}
