#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

bool zero_check(const ll N, const vll& a, const vll& b){
  REP(i, N){
    if(a[i]!=0) return false;
  }
  REP(i, N){
    if(b[i]!=0) return false;
  }
  return true;
}

ll kuriagari(ll N, vll a_lower, vll b_lower, ll border){
  sort(a_lower.begin(), a_lower.end());
  sort(b_lower.begin(), b_lower.end());

  ll count = 0;
  ll head = N-1;
  ll tail = 0;
  while(true){
    if(tail>=N) break;
    if(a_lower[tail]+b_lower[head]>=border){
      count+=N-tail;
      head--;
      if(head<0) break;
    }else{
      tail++;
    }
  }
  return count;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N;
  cin >> N;
  vll a(N), b(N);
  REP(i, N) cin >> a[i];
  REP(i, N) cin >> b[i];
  vll a_lower(N, 0), b_lower(N, 0);

  ll ans=0;
  ll tmp=1;

  while(!zero_check(N, a, b)){
    ll a_count = 0;
    ll b_count = 0;
    REP(i, N){
      a_count+=a[i]%2;
      b_count+=b[i]%2;
    }
    //kuriagari check
    ll kuriagari_count = kuriagari(N, a_lower, b_lower, tmp);

    ans += (((a_count+b_count)*(N%2)+kuriagari_count)%2)*tmp;

    REP(i, N){
      a_lower[i] += (a[i]%2)*tmp;
      b_lower[i] += (b[i]%2)*tmp;
      a[i]>>=1;
      b[i]>>=1;
    }
    tmp*=2;
  }

  ll kuriagari_count = kuriagari(N, a_lower, b_lower, tmp);

  ans += (kuriagari_count%2)*tmp;

  printf("%d\n", ans);

  return 0;
}


Measured memory_bytes: 9704