import java.io.*;
import java.util.*;

class Solver {
  final int n;
  final int[] as, bs;
  
  Solver(int n, int[] as, int[] bs) {
    this.n = n;
    this.as = as;
    this.bs = bs;
  }
  
  private int getCount1(int[] vs, int rightShift) {
    int count = 0;
    for (int v : vs) {
      count += ((v >> rightShift) & 1);
    }
    return count;
  }
  
  public int solve() {
    int answer = 0;
    // 0 bit
    if (n % 2 == 1 && (getCount1(as, 0) + getCount1(bs, 0)) % 2 == 1) {
      answer |= 1;
    }
    
    // 1 bit 以上
    for (int i = 1; i <= 29; i++) {
      int aCount = getCount1(as, i);
      int bCount = getCount1(bs, i);
      
      int mask = (1 << i) - 1;
      /*
      TreeMap<Integer, Integer> counter = new TreeMap<Integer, Integer>();
      for (int b : bs) {
        int bMask = b & mask;
        counter.put(bMask, counter.getOrDefault(bMask, 0) + 1);
      }
      */
      Map<Integer, Integer> counter = new HashMap<Integer, Integer>();
      counter.put(1 << i, 0);
      counter.put(0, 0);
      for (int b : bs) {
        int bMask = b & mask;
        counter.put(bMask, counter.getOrDefault(bMask, 0) + 1);
      }
      List<Integer> sortedBMaskList = new ArrayList<>();
      sortedBMaskList.add(1 << i);
      for (int bMask : counter.keySet()) {
        sortedBMaskList.add(bMask);
      }
      Collections.sort(sortedBMaskList);
      
      /*
      TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
      int total = 0;
      map.put(1 << i, total);
      for (int j = sortedBMaskList.size() - 1; j >= 0; j--) {
        int bMask = sortedBMaskList.get(j);
        total += counter.get(bMask);
        map.put(bMask, total);
      }
      
      long carryCount = 0;
      for (int a : as) {
        int aMask = a & mask;
        int required = (1 << i) - aMask;
        carryCount += map.ceilingEntry(required).getValue();
      }
      */
      int[] values = new int[sortedBMaskList.size()];
      values[values.length - 1] = 0;
      for (int j = values.length - 2; j >= 0; j--) {
        values[j] = values[j+1] + counter.get(sortedBMaskList.get(j));
      }
      
      long carryCount = 0;
      for (int a : as) {
        int aMask = a & mask;
        int required = (1 << i) - aMask;
        int indexMin = 0;
        int indexMax = values.length - 1;
        while (indexMax - indexMin > 1) {
          int indexMid = (indexMax + indexMin) / 2;
          if (sortedBMaskList.get(indexMid) == required) {
            indexMin = indexMid;
            indexMax = indexMid;
          } else if (sortedBMaskList.get(indexMid) < required) {
            indexMin = indexMid;
          } else {
            indexMax = indexMid;
          }
        }
        carryCount += values[indexMax];
      }
      
      
//      System.out.printf("%d %d %d %d\n", i, aCount, bCount, carryCount);
      if ((n % 2 == 1 && (aCount + bCount) % 2 == 1) != ((carryCount % 2) == 1)) {
        answer |= (1 << i);
      }
    }
    return answer;
  }
}

public class Main {
  private static void execute(ContestReader reader, PrintWriter out) {
    int n = reader.nextInt();
    int[] as = reader.nextIntArray(n);
    int[] bs = reader.nextIntArray(n);
    out.println(new Solver(n, as, bs).solve());
  }
  
  public static void main(String[] args) {
    ContestReader reader = new ContestReader(System.in);
    PrintWriter out = new PrintWriter(System.out);
    execute(reader, out);
    out.flush();
  }
}

class ContestReader {
  private BufferedReader reader;
  private StringTokenizer tokenizer;
  
  ContestReader(InputStream in) {
    reader = new BufferedReader(new InputStreamReader(in));
  }
  
  public String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }
  
  public int nextInt() {
    return Integer.parseInt(next());
  }
  
  public long nextLong() {
    return Long.parseLong(next());
  }
  
  public double nextDouble() {
    return Double.parseDouble(next());
  }
  
  public String[] nextArray(int n) {
    String[] array = new String[n];
    for (int i = 0; i < n; i++) {
      array[i] = next();
    }
    return array;
  }
  
  public int[] nextIntArray(int n) {
    int[] array = new int[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextInt();
    }
    return array;
  }
  
  public long[] nextLongArray(int n) {
    long[] array = new long[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextLong();
    }
    return array;
  }
  
  public double[] nextDoubleArray(int n) {
    double[] array = new double[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextDouble();
    }
    return array;
  }
  
  public int[][] nextIntMatrix(int n, int m) {
    int[][] matrix = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextInt();
      }
    }
    return matrix;
  }
  
  public long[][] nextLongMatrix(int n, int m) {
    long[][] matrix = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextLong();
      }
    }
    return matrix;
  }
  
  public double[][] nextDoubleMatrix(int n, int m) {
    double[][] matrix = new double[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextDouble();
      }
    }
    return matrix;
  }
}

class ModCalculator {
  private final long mod;
  
  ModCalculator(long mod) {
    this.mod = mod;
  }
  
  public long add(long a, long b) {
    return (a + b) % mod;
  }
  
  public long mul(long a, long b) {
    return (a * b) % mod;
  }
  
  public long pow(long a, long b) {
    if (b == 0) {
      return 1;
    }
    long v = pow(mul(a, a), b / 2);
    if (b % 2 == 1) {
      return mul(v, a);
    } else {
      return v;
    }
  }
  
  public long inverse(long a) {
    return pow(a, mod - 2);
  }
  
  public long div(long a, long b) {
    return mul(a, inverse(b));
  }
}
 
class ModCombinationCache {
  private final ModCalculator modCalculator;
  private final List<Long> factorialCache;
  private final List<Long> factorialInverseCache;
  
  public ModCombinationCache(ModCalculator modCalculator) {
    this.modCalculator = modCalculator;
    factorialCache = new ArrayList<>();
    factorialCache.add(1L);
    factorialInverseCache = new ArrayList<>();
    factorialInverseCache.add(1L);
  }
  
  private void resize(int n) {
    for (int i = factorialCache.size() - 1; i < n; i++) {
      long v = modCalculator.mul(factorialCache.get(i), i + 1);
      factorialCache.add(v);
      factorialInverseCache.add(modCalculator.inverse(v));
    }
  }
  
  public long getP(int n) {
    resize(n);
    return factorialCache.get(n);
  }
  
  public long getC(int n, int k) {
    resize(n);
    return modCalculator.mul(factorialCache.get(n), modCalculator.mul(factorialInverseCache.get(k), factorialInverseCache.get(n-k)));
  }
}

class Algorithm {
  private static void swap(Object[] list, int a, int b) {
    Object tmp = list[a];
    list[a] = list[b];
    list[b] = tmp;
  }
  
  public static <T extends Comparable<? super T>> boolean nextPermutation(T[] ts) {
    int rightMostAscendingOrderIndex = ts.length - 2;
    while (rightMostAscendingOrderIndex >= 0 &&
        ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostAscendingOrderIndex + 1]) >= 0) {
      rightMostAscendingOrderIndex--;
    }
    if (rightMostAscendingOrderIndex < 0) {
      return false;
    }
    
    int rightMostGreatorIndex = ts.length - 1;
    while (ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostGreatorIndex]) >= 0) {
      rightMostGreatorIndex--;
    }
    
    swap(ts, rightMostAscendingOrderIndex, rightMostGreatorIndex);
    for (int i = 0; i < (ts.length - rightMostAscendingOrderIndex - 1) / 2; i++) {
      swap(ts, rightMostAscendingOrderIndex + 1 + i, ts.length - 1 - i);
    }
    return true;
  }
  
  public static void shuffle(int[] array) {
    Random random = new Random();
    int n = array.length;
    for (int i = 0; i < n; i++) {
      int randomIndex = i + random.nextInt(n - i);
      
      int temp = array[i];
      array[i] = array[randomIndex];
      array[randomIndex] = temp;
    }
  }
  
  public static void shuffle(long[] array) {
    Random random = new Random();
    int n = array.length;
    for (int i = 0; i < n; i++) {
      int randomIndex = i + random.nextInt(n - i);
      
      long temp = array[i];
      array[i] = array[randomIndex];
      array[randomIndex] = temp;
    }
  }
  
  public static void sort(int[] array) {
    shuffle(array);
    Arrays.sort(array);
  }
  
  public static void sort(long[] array) {
    shuffle(array);
    Arrays.sort(array);
  }
}

class UnionFind {
  int[] parents;
  int[] ranks;

  UnionFind(int n) {
    parents = new int[n];
    ranks = new int[n];

    for (int i = 0; i < n; i++) {
      parents[i] = i;
    }
  }

  public int getRoot(int index) {
    if (parents[index] == index) {
      return index;
    } else {
      parents[index] = getRoot(parents[index]);
      return parents[index];
    }
  }

  public boolean sameGroup(int a, int b) {
    return getRoot(a) == getRoot(b);
  }

  public void merge(int a, int b) {
    int rootA = getRoot(a);
    int rootB = getRoot(b);
    if (rootA == rootB) {
      return;
    }
    if (ranks[rootA] < ranks[rootB]) {
      parents[rootA] = rootB;
    } else if (ranks[rootB] < ranks[rootA]) {
      parents[rootB] = rootA;
    } else {
      parents[rootA] = rootB;
      ranks[rootB]++;
    }
  }
}


Measured memory_bytes: 177860