#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 20;
int b[maxn];
int c[maxn];
int a[maxn];
int t[maxn];
int n;
bool dp[maxn][32];
int cnt[32];
bool check() {
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= 30; ++j) {
      dp[i][j] = a[i] & (1 << j);
      cnt[j] += dp[i][j];
    }
  }
  for (int i = 1; i <= n; ++i) {
    int tb = 0;
    int tc = 0;
    for (int j = 0; j <= 30; ++j) {
      if (dp[i][j]) {
        tc += (1 << j) * n;
      } else {
        tc += (1 << j) * cnt[j];
      }
      if (dp[i][j] == 0) continue;
      tb += (1 << j) * cnt[j];
    }
    if (tb != b[i] || tc != c[i]) {
      return false;
    }
  }
  return true;
}
void work() {
  cin >> n;
  long long int sum = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> b[i];
    sum += b[i];
  }
  for (int i = 1; i <= n; ++i) {
    cin >> c[i];
    t[i] = b[i] + c[i];
    sum += c[i];
  }
  if (sum % (2 * n) != 0) {
    printf("-1\n");
    return;
  }
  long long int tsum = sum / (2 * n);
  for (int i = 1; i <= n; ++i) {
    if (t[i] - tsum < 0 || (t[i] - tsum) % n != 0) {
      printf("-1\n");
      return;
    }
    a[i] = (t[i] - tsum) / n;
  }
  if (!check()) {
    cout << "-1" << endl;
    return;
  }
  for (int i = 1; i <= n; ++i) {
    cout << a[i] << " ";
  }
}
int main() {
  work();
  return 0;
}
