#include <bits/stdc++.h>
using namespace std;
int frc[100];
int b[200010], c[200010], a[200010];
int main() {
  int n;
  scanf("%d", &n);
  long long s(0);
  for (int i(0); i < n; i++) scanf("%d", &b[i]);
  for (int i(0); i < n; i++) scanf("%d", &c[i]);
  for (int i(0); i < n; i++) s += 1ll * b[i] + 1ll * c[i];
  if (s % (2 * n) != 0) {
    cout << -1;
    return 0;
  }
  s /= 2 * n;
  for (int i(0); i < n; i++) {
    if ((b[i] + c[i] - s) % n != 0) {
      cout << -1;
      return 0;
    }
    a[i] = (b[i] + c[i] - s) / n;
    for (int j(0); j <= 30; j++)
      if ((a[i] & (1 << j))) frc[j]++;
  }
  for (int i(0); i < n; i++) {
    long long c0(0), b0(0);
    for (int j(0); j <= 30; j++) {
      if ((a[i] & (1 << j)))
        c0 += 1ll * n * (1 << j), b0 += 1ll * frc[j] * (1 << j);
      else
        c0 += 1ll * frc[j] * (1 << j);
    }
    if (c0 != c[i] || b0 != b[i]) {
      cout << -1;
      return 0;
    }
  }
  for (int i(0); i < n; i++) cout << a[i] << ' ';
  return 0;
}
