#include <bits/stdc++.h>
using namespace std;
long long n, b[(200000 + 7)], c[(200000 + 7)], z[(200000 + 7)], sum,
    a[(200000 + 7)], b2[(200000 + 7)], c2[(200000 + 7)];
int main() {
  scanf("%I64d", &n);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &b[i]);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &c[i]);
  for (int i = 1; i <= n; ++i) {
    if (b[i] > c[i]) {
      printf("-1\n");
      return 0;
    }
    z[i] = b[i] + c[i];
    sum += z[i];
  }
  sum /= 2;
  sum /= n;
  for (int i = 1; i <= n; ++i) a[i] = (z[i] - sum) / n;
  for (int pw = 31; pw >= 0; --pw) {
    int cnt = 0;
    for (int i = 1; i <= n; ++i)
      if ((1 << pw) & a[i]) cnt++;
    for (int i = 1; i <= n; ++i) {
      if ((1 << pw) & a[i]) {
        b2[i] += cnt * (1 << pw);
        c2[i] += n * (1 << pw);
      } else {
        c2[i] += cnt * (1 << pw);
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (b[i] != b2[i] || c[i] != c2[i]) {
      printf("-1\n");
      return 0;
    }
  }
  for (int i = 1; i <= n; ++i) printf("%I64d ", a[i]);
  printf("\n");
  return 0;
}
