#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

#define SUM_MAX (1 << 29)

ll solve(int N, vi& a, vi& b) {
    sort(ALL(a)); sort(ALL(b));
    int ans = 0;
//    for (int k=0,sc=1; k<28+1; ++k,sc<<=1) {
    for (int k=28,sc=1<<28; k>=0; --k,sc>>=1) {
        for (int &bi : b) bi %= 2*sc;
        sort(ALL(b));

        int bitcount = 0;
        for (int ai : a) {
            ai %= 2*sc;
            /*
            ai+bj の 2^k (=1<<k) ビットが1になる、ってことは
            ai+bj は [1, 2)*2^k, [3,4)*2^k, ... の範囲にある

            ai,bjともに[0,2^28]なので和は[0,2^29]の範囲にある
            */
            for (int base=1; base<4; base+=2) {
                int from = base*sc - ai, to = (base+1)*sc - ai;
                // [from, to)
                int from_ix = lower_bound(ALL(b), from) - b.begin();
                int to_ix = lower_bound(ALL(b), to) - b.begin();

                bitcount += to_ix - from_ix;
            }
        }
        ans = (ans << 1) | (bitcount & 1);
    }
    return ans;
}

int main() {
    int N = loadint();
    vi a(N), b(N);
    loadvec(a,N); loadvec(b,N);
    cout << solve(N,a,b) << endl;
    return 0;
}


Measured memory_bytes: 3712