#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200010;
int n;
int cnt[70];
long long a[MAX_N], b[MAX_N], c[MAX_N];
bool solve() {
  if (n == 1) {
    if ((b[1] | b[1]) == c[1]) {
      a[1] = b[1];
      return true;
    } else
      return false;
  }
  long long sum = 0;
  for (int i = 1; i <= n; ++i) {
    sum += b[i] + c[i];
  }
  if (sum % (2 * n)) return false;
  sum /= (2 * n);
  for (int i = 1; i <= n; ++i) {
    long long left = b[i] + c[i] - sum;
    if (left < 0 || left % n) return false;
    a[i] = left / n;
  }
  memset(cnt, 0, sizeof(cnt));
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= 60; ++j) {
      if ((a[i] >> j) & 1) cnt[j]++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    long long tb = 0, tc = 0;
    for (int j = 0; j <= 60; ++j) {
      if ((a[i] >> j) & 1) {
        tb += 1ll * cnt[j] * (1ll << j);
        tc += 1ll * n * (1ll << j);
      } else
        tc += 1ll * cnt[j] * (1ll << j);
    }
    if (tb != b[i] || tc != c[i]) return false;
  }
  return true;
}
int main() {
  while (~scanf("%d", &n)) {
    for (int i = 1; i <= n; ++i) scanf("%lld", &b[i]);
    for (int i = 1; i <= n; ++i) scanf("%lld", &c[i]);
    if (solve() == false)
      printf("-1");
    else
      for (int i = 1; i <= n; ++i) printf("%lld ", a[i]);
    printf("\n");
  }
  return 0;
}
