#include <stdio.h>
 
int min(int a, int b) {
    return a < b ? a : b;
}
 
int max(int a, int b) {
    return a > b ? a : b;
}
 
int calculate_min_max_xor(int arr[], int n) {
    int min_max_xor = 0;
 
    // Count the number of occurrences of each bit
    for (int bit = 30; bit >= 0; bit--) {
        int count = 0;
        for (int i = 0; i < n; i++) {
            if (arr[i] & (1 << bit))
                count++;
        }
 
        // For each bit position, if count is odd, then set the bit in the answer
        if (count % 2 == 1)
            min_max_xor |= (1 << bit);
    }
 
    return min_max_xor;
}
 
int main() {
    int n;
    scanf("%d", &n);
 
    int arr[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
 
    int min_max_xor = calculate_min_max_xor(arr, n);
    printf("%d\n", min_max_xor);
 
    return 0;
}