#include <bits/stdc++.h>
using namespace std;
const long long maxn = 300909;
const long long maxN = 2e6 + 5;
const long long oo = 1e18;
const long long mod = 1e9 + 7;
long long n, a[maxn], b[maxn], c[maxn], d[maxn], b1[maxn], c1[maxn], s = 0;
long long e[40];
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> b[i];
  for (long long i = 1; i <= n; i++) {
    cin >> c[i];
    d[i] = c[i] + b[i];
    s += d[i];
  }
  s = s / (2 * n);
  for (long long i = 1; i <= n; i++) {
    a[i] = (d[i] - s) / n;
  }
  for (long long i = 0; i <= 30; i++) {
    for (long long j = 1; j <= n; j++) {
      e[i] += ((a[j] & (1 << i)) != 0);
    }
  }
  for (long long i = 0; i <= 30; i++) {
    for (long long j = 1; j <= n; j++) {
      if ((a[j] & (1 << i)) != 0) {
        b1[j] += (e[i] << i);
        c1[j] += (n << i);
      } else
        c1[j] += (e[i] << i);
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (b[i] == b1[i] && c[i] == c1[i]) continue;
    cout << "-1\n";
    return 0;
  }
  for (long long i = 1; i <= n; i++) cout << a[i] << " ";
}
