#include <bits/stdc++.h>
using namespace std;
int n;
long long b[200009];
long long c[200009];
long long tmp[200009];
long long d[53];
long long pow(int x, int y) {
  if (y == 0) return 1;
  return pow(x, y - 1) * x;
}
int main() {
  cin >> n;
  long long x = 0;
  for (int i = 1; i <= n; i++) {
    cin >> b[i];
    x = x + b[i];
  }
  for (int j = 1; j <= n; j++) {
    cin >> c[j];
    x = x + c[j];
  }
  if (x % (2 * n) == 0) {
    x = x / (2 * n);
    for (int i = 1; i <= n; i++) {
      if ((b[i] + c[i] - x) % n == 0) {
        tmp[i] = (b[i] + c[i] - x) / n;
      } else {
        cout << "-1" << endl;
        return 0;
      }
    }
  } else {
    cout << "-1" << endl;
    return 0;
  }
  for (int i = 1; i <= min(10, n); i++) {
    long long tam = 0;
    long long dem = 0;
    for (int j = 1; j <= n; j++) {
      tam = tam + (tmp[i] & tmp[j]);
      dem = dem + (tmp[i] | tmp[j]);
    }
    if (tam != b[i] || dem != c[i]) {
      cout << "-1" << endl;
      return 0;
    }
  }
  for (int i = 1; i <= min(10, n); i++) {
    long long tam = 0;
    long long dem = 0;
    for (int j = 1; j <= n; j++) {
      tam = tam + (tmp[n - i + 1] & tmp[j]);
      dem = dem + (tmp[n - i + 1] | tmp[j]);
    }
    if (tam != b[n - i + 1] || dem != c[n - i + 1]) {
      cout << "-1" << endl;
      return 0;
    }
  }
  for (int i = 1; i <= 50; i++) {
    for (int j = 1; j <= n; j++) {
      long long o = tmp[j] & ((long long)1 << (i - 1));
      if (o != 0) {
        long long ak = ((long long)1 << (i - 1));
        d[i]++;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    long long sum = 0;
    for (int j = 1; j <= 50; j++) {
      int k = ((long long)1 << (j - 1)) & tmp[i];
      if (k != 0) {
        sum = sum + d[j] * ((long long)1 << (j - 1));
      }
    }
    if (sum != b[i]) {
      cout << "-1" << endl;
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    long long sum = 0;
    for (int j = 1; j <= 50; j++) {
      int k = ((long long)1 << (j - 1)) & tmp[i];
      if (k != 0) {
        sum = sum + n * ((long long)1 << (j - 1));
      } else {
        sum = sum + d[j] * ((long long)1 << (j - 1));
      }
    }
    if (sum != c[i]) {
      cout << "-1" << endl;
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << tmp[i] << ' ';
  }
  return 0;
}
