#include <bits/stdc++.h>
long long a[200005], b[200005], c[200005], cnt[105];
int main() {
  long long n;
  while (scanf("%I64d", &n) != EOF) {
    long long i, j, sum = 0;
    for (i = 0; i < n; i++) {
      scanf("%I64d", &b[i]);
      sum += b[i];
    }
    for (i = 0; i < n; i++) {
      scanf("%I64d", &c[i]);
      sum += c[i];
    }
    long long zt = 0;
    if (sum % (2 * n))
      zt = 1;
    else
      sum /= (2 * n);
    for (i = 0; i < n; i++) {
      if (zt || (b[i] + c[i] - sum) % n || b[i] + c[i] < sum) {
        zt = 1;
        break;
      }
      a[i] = (b[i] + c[i] - sum) / n;
    }
    memset(cnt, 0, sizeof(cnt));
    for (i = 0; i < n; i++) {
      for (j = 0; j < 60; j++) {
        if ((a[i] >> j) & 1) cnt[j]++;
      }
    }
    long long sumb, sumc;
    for (i = 0; i < n; i++) {
      sumb = 0;
      sumc = 0;
      for (j = 0; j < 60; j++) {
        if ((a[i] >> j) & 1) {
          sumb += cnt[j] * (1LL << j);
          sumc += n * (1LL << j);
        } else
          sumc += cnt[j] * (1LL << j);
      }
      if (zt || sumb != b[i] || sumc != c[i]) {
        zt = 1;
        break;
      }
    }
    if (zt)
      printf("-1\n");
    else {
      for (i = 0; i < n; i++) {
        if (i) printf(" ");
        printf("%I64d", a[i]);
      }
      printf("\n");
    }
  }
}
