#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 2e5 + 4;
int main() {
  int n;
  scanf("%d", &n);
  long long b[n], c[n], sum = 0;
  for (int i = 0; i < n; i++) scanf("%lld", &b[i]), sum += b[i];
  for (int i = 0; i < n; i++) scanf("%lld", &c[i]), sum += c[i];
  if (sum % 2 * n != 0) {
    printf("%d", -1);
    return 0;
  }
  sum /= 2 * n;
  long long a[n];
  for (int i = 0; i < n; i++) {
    long long here = b[i] + c[i] - sum;
    if (here >= 0 and here % n != 0) {
      printf("%d", -1);
      return 0;
    }
    a[i] = here / n;
  }
  vector<int> fa(31, 0);
  for (int bit = 0; bit < 31; bit++) {
    for (int i = 0; i < n; i++)
      if (a[i] & (1LL << bit)) fa[bit]++;
  }
  for (int i = 0; i < n; i++) {
    for (int bit = 0; bit < 31; bit++)
      if (a[i] & (1LL << bit)) b[i] -= (1LL << bit) * fa[bit];
    if (b[i] != 0) {
      printf("%d", -1);
      return 0;
    }
  }
  for (int i = 0; i < n; i++) printf("%lld ", a[i]);
  return 0;
}
