#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100, LOG = 30;
void bad() {
  cout << -1;
  exit(0);
}
int n, a[N], b[N], c[N], cnt[LOG];
long long s;
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    s += b[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> c[i];
    s += c[i];
  }
  s /= 2 * n;
  for (int i = 0; i < n; i++) {
    a[i] = (b[i] + c[i] - s) / n;
    if (a[i] < 0) bad();
    for (int j = 0; j < LOG; j++) cnt[j] += (a[i] >> j) & 1;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < LOG; j++)
      if (a[i] & (1 << j)) {
        b[i] -= (cnt[j] << j);
        c[i] -= n << j;
      } else
        c[i] -= cnt[j] << j;
    if (b[i] || c[i]) bad();
  }
  for (int i = 0; i < n; i++) cout << a[i] << ' ';
  return 0;
}
