#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

Int add(Int a, Int b){
  Int res = 0;
  Int c = 0;
  for(Int i=0;i<10;i++){
    Int t = (a>>i&1) ^ (b>>i&1); //最下位ビットxor
    Int u = (a>>i&1) & (b>>i&1); //最下位ビットand(桁上がり)
    Int nc = u;
    if(t == 0 && c == 1) t = 1;
    else if(t == 1 && c == 1) t = 0, nc = 1;
    pr(t, u, c, nc);
    res |= t<<i;
    c = nc;
  }
  return res;
}


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N;
  cin>>N;

  vector<Int> A(N);
  vector<Int> B(N);
  cin>>A>>B;

  sort(A.begin(), A.end());
  sort(B.begin(), B.end());

  vector<vector<Int> > C(30);
  for(Int i=0;i<30;i++){
    C[i].resize(N);
    for(Int j=0;j<N;j++) C[i][j] = B[j] % (1<<(i+1));
    sort(C[i].begin(), C[i].end());
  }

  auto count = [&](vector<Int> &V, Int l, Int r){
    return upper_bound(V.begin(), V.end(), r) - lower_bound(V.begin(), V.end(), l);
  };

  Int ans = 0;
  for(Int i=0;i<30;i++){
    unordered_map<Int,Int> mem;
    for(Int t:A){
      Int a = t % (1LL<<(i + 1));
      if(mem.count(a)){
        Int num = mem[a];
        if(num%2) ans ^= (1LL<<i);
        continue;
      }
      Int l = (1LL<<i);
      Int r = (1LL<<(i + 1)) - 1;
      Int num = 0;
      if(l - a >= 0) num += count(C[i], l - a, r - a);
      else{
        num += count(C[i], 0, r - a);
        //a[i] >= 2 ** k
        //a[i] + b[i] >= (2**(k+1)) + (2 ** k)
        //b[i] >= (2**(k+1)) + (2 ** k) - a[i];
        num += count(C[i], (1LL<<(i + 1)) + (1LL<<i) - a, r);
      }
      if(num%2) ans ^= (1LL<<i);
      mem[a] = num;
    }
  }

  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 58620