#include <bits/stdc++.h>
using namespace std;
const int S = 200003;
char buf[1000000], *p1, *p2;
inline char gc() {
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline int rd() {
  register int f = 0;
  register char c = gc();
  while (c < 48 || c > 57) c = gc();
  while (c > 47 && c < 58) f = f * 10 + (c ^ 48), c = gc();
  return f;
}
int a[S], b[S], c[S];
int main() {
  register int n = rd(), i, j, d;
  long long s = 0;
  for (i = 1; i <= n; ++i) s += (b[i] = rd());
  for (i = 1; i <= n; ++i) s += (c[i] = rd());
  s /= (n << 1);
  for (i = 1; i <= n; ++i) a[i] = (b[i] + c[i] - s) / n;
  for (i = 0; i < 31; ++i) {
    d = 0;
    for (j = 1; j <= n; ++j)
      if (a[j] & (1 << i)) ++d, c[j] -= n * (1 << i);
    for (j = 1; j <= n; ++j)
      if (a[j] & (1 << i))
        b[j] -= d * (1 << i);
      else
        c[j] -= d * (1 << i);
  }
  for (i = 1; i <= n; ++i)
    if (b[i] || c[i]) {
      printf("-1");
      return 0;
    }
  for (i = 1; i <= n; ++i) printf("%d ", a[i]);
  return 0;
}
