#include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345;
int b[MAXN], c[MAXN];
int a[MAXN];
int ones[32];
int main() {
  int n;
  int i, j;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &b[i]);
  for (i = 0; i < n; i++) scanf("%d", &c[i]);
  long long sum = 0;
  for (i = 0; i < n; i++) sum += b[i] + c[i];
  if (sum % (2 * n) != 0) {
    printf("-1\n");
    exit(0);
  }
  sum /= 2 * n;
  for (i = 0; i < n; i++) {
    if ((b[i] + c[i] - sum) % n != 0) {
      printf("-1\n");
      exit(0);
    }
    a[i] = (b[i] + c[i] - sum) / n;
    if (a[i] < 0 || (long long)a[i] * n != b[i] + c[i] - sum) {
      printf("-1\n");
      exit(0);
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < 31; j++) ones[j] += a[i] >> j & 1;
  }
  for (i = 0; i < n; i++) {
    long long t = 0;
    for (j = 0; j < 31; j++) {
      if (a[i] >> j & 1) {
        t += (1LL << j) * ones[j];
      }
    }
    if (t != b[i]) {
      printf("-1\n");
      exit(0);
    }
    t = 0;
    for (j = 0; j < 31; j++) {
      if (a[i] >> j & 1) {
        t += (1LL << j) * n;
      } else {
        t += (1LL << j) * ones[j];
      }
    }
    if (t != c[i]) {
      printf("-1\n");
      exit(0);
    }
  }
  for (i = 0; i < n; i++) printf("%d ", a[i]);
  puts("");
  return 0;
}
