#include <bits/stdc++.h>
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &first) { scanf("%d", &first); }
void fast_scan(long long &first) { scanf("%lld", &first); }
void fast_scan(unsigned long long &first) { scanf("%llu", &first); }
void fast_scan(double &first) { scanf("%lf", &first); }
void fast_scan(long double &first) { scanf("%Lf", &first); }
void fast_scan(char &first) {
  scanf("%c", &first);
  if (first == '\n') {
    fast_scan(first);
  }
}
void fast_scan(string &first) {
  scanf("%s", string_in_buffer);
  first = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
  fast_scan(p.first);
  fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
  for (auto &first : v) fast_scan(first);
}
void fast_print(const int &first) { printf("%d", first); }
void fast_print(const long long &first) { printf("%lld", first); }
void fast_print(const unsigned long long &first) { printf("%llu", first); }
void fast_print(const double &first) { printf("%.15lf", first); }
void fast_print(const long double &first) { printf("%.15Lf", first); }
void fast_print(const char &first) { printf("%c", first); };
void fast_print(const string &first) { printf("%s", first.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
  fast_print(p.first);
  fast_print(' ');
  fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print(' ');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print('\n');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const T &v) {
  for (const auto &first : v) {
    fast_print(first);
    fast_print(' ');
  }
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
  fast_print(print_start);
  print_start = "\n";
  first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T kek, Args... args) {
  if (!first_print) {
    fast_print("\n");
  } else {
    first_print = false;
  }
  fast_print(names.front());
  fast_print(" = ");
  fast_print(kek);
  names.pop_front();
  _print(names, args...);
}
}  // namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
  if (!smart_io::first_print) {
    fast_print(smart_io::sep);
  } else {
    smart_io::first_print = false;
  }
  fast_print(object);
  return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
  fast_scan(object);
  return is;
}
namespace typedefs {}
namespace numbers_operation {
template <class T>
T floor_mod(T a, T b) {
  if (a % b == 0) return 0;
  if (a >= 0 && b >= 0) return a % b;
  if (a <= 0 && b <= 0) return a % b;
  return abs(b) - (abs(a) % abs(b));
}
}  // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
int n;
vector<long long> v;
vector<long long> key;
long long rev(long long first) {
  long long rez = 0;
  for (int i = 0; i < 32; i++) {
    if (first & (1LL << i)) {
      rez = (rez | (1LL << (31 - i)));
    }
  }
  return rez;
}
struct Node {
  Node *zero = NULL;
  Node *one = NULL;
  int depth = 0;
  int ends = 0;
  Node(int _depth) { depth = _depth; }
  void add(long long first) {
    ends++;
    if (depth == 32) {
    } else {
      long long kek = (1LL << depth);
      if (kek & first) {
        if (!one) {
          one = new Node(depth + 1);
        }
        one->add(first);
      } else {
        if (!zero) {
          zero = new Node(depth + 1);
        }
        zero->add(first);
      }
    }
  }
  long long best(long long first) {
    ends--;
    if (depth == 32) {
      return first;
    } else {
      long long kek = (1LL << depth);
      if (kek & first) {
        if (one && one->ends) {
          return one->best(first ^ kek);
        } else {
          return zero->best(first);
        }
      } else {
        if (zero && zero->ends) {
          return zero->best(first);
        } else {
          return one->best(first ^ kek);
        }
      }
    }
  }
};
Node *root = new Node(0);
signed main(signed argc, char *argv[]) {
  {
    cin, n;
    v.resize(n);
    key.resize(n);
    cin, v, key;
  }
  {
    for (long long first : key) {
      root->add(rev(first));
    }
  }
  {
    vector<long long> rez;
    for (long long first : v) {
      rez.push_back(rev(root->best(rev(first))));
    }
    smart_io::precall_print();
    cout, rez;
  }
}
