#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int lg = 20;
const int mod = 1e9 + 7;
long long a[N], b[N], ans[N], dp[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  if (fopen("A.inp", "r")) {
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
  }
  long long n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  if (n == 1) {
    if (a[1] != b[1])
      return cout << -1, 0;
    else
      return cout << b[1], 0;
  }
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    sum = sum + a[i] + b[i];
  }
  if (sum % (2 * n)) return cout << -1, 0;
  sum /= (2 * n);
  for (int i = 1; i <= n; i++) ans[i] = (a[i] + b[i] - sum) / n;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= 30; j++) {
      if (ans[i] & (1 << j)) dp[j]++;
    }
  }
  for (int i = 1; i <= n; i++) {
    long long tmpa = 0, tmpb = 0;
    for (int j = 0; j <= 30; j++) {
      if (ans[i] & (1 << j)) {
        tmpa += dp[j] * (1 << j);
        tmpb += n * (1 << j);
      } else
        tmpb += (dp[j] * (1 << j));
    }
    if (tmpa != a[i] || tmpb != b[i]) return cout << -1, 0;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
}
