#include <bits/stdc++.h>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (lower_bound(ALL(c),x)-upper_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DEL(v) decltype(v)().swap(v)
#define fs first
#define sc second
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define NL cerr << endl;
using namespace std;
template<typename T1, typename T2> using P = pair<T1,T2>;
template<typename T> using V = vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<typename T>T sum(vector<T>&a){return accumulate(ALL(a),T());}
template<typename T>T max(vector<T>&a){return *max_element(ALL(a));}
template<typename T>T min(vector<T>&a){return *max_element(ALL(a));}
template<typename T>T max_index(vector<T>&a){return distance((a).begin(),max_element(ALL(a)));}
template<typename T>T min_index(vector<T>&a){return distance((a).begin(),min_element(ALL(a)));}

struct edge { int from, to; int cost; };
bool operator< (const edge &edge1, const edge &edge2) { return edge1.cost < edge2.cost; };
const int INF = 1e18;
const int MOD = 1e9+7;

template<typename T> ostream& operator << (ostream& s, const V<T>& v) {
   s << "[";
   for (int i = 0; i < v.size(); i++) { s << v[i]; if (i < v.size() - 1) s << " "; }
   s << "]";
   return s;
}
template<typename T1, typename T2> ostream& operator << (ostream& s, const P<T1,T2>& p) {
   s << "(" << p.first << "," << p.second << ")";
   return s;
}
template<typename T> ostream& operator << (ostream& s, const set<T>& st) {
   s << "{";
   for (auto i = st.begin(); i != st.end(); ++i) {
      s << *i;
      if (next(i) != st.end()) s << ", ";
   }
   s << "}";
   return s;
}
template<typename T1, typename T2> ostream& operator << (ostream& s, const map<T1,T2>& m) {
   s << "{";
   for (auto i = m.begin(); i != m.end(); ++i) {
      s << i->first << ":" << i->second;
      if (next(i) != m.end()) s << ", ";
   }
   s << "}";
   return s;
}

signed main()
{
   int N; cin >> N;
   V<int> a(N), b(N);
   REP(i, N) {
      cin >> a[i];
   }
   REP(i, N) {
      cin >> b[i];
   }

   const int MAX_K = 28;
   int ans = 0;
   FORE(k, 0, MAX_K+1) {
      V<int> A(N), B(N);
      REP(i, N) {
         A[i] = a[i] % (1LL<<(k+1));
         B[i] = b[i] % (1LL<<(k+1));
      }
      SORT(B);
      int cnt = 0;
      REP(i, N) {
         cnt += LB(B,2*(1LL<<k)-A[i]) - LB(B,  (1LL<<k)-A[i]);
         cnt += LB(B,4*(1LL<<k)-A[i]) - LB(B,3*(1LL<<k)-A[i]);
      }
      ans |= (cnt % 2) << k;
   }

   cout << ans << endl;

   return 0;
}


Measured memory_bytes: 6552