#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int main(void) {
    ifstream fin("XORcipher.in");
    ofstream fout("XORcipher.out");
    int n;
    fin >> n;
    int* arr1 = new int[n];
    int* arr2 = new int[n];
    for(int i = 0; i < n; ++i)
        fin >> arr1[i];
    for(int i = 0; i < n; ++i)
        fin >> arr2[i];
    
    int ans;
    bool valid = true;
    for(int i = 0; i < n; ++i) {
        ans = arr1[0] ^ arr2[i];
        for(int j = 1; j < n; ++j) {
            if(find(arr2, arr2+n, arr1[j] ^ ans) == arr2+n) {
                valid = false;
                break;
            }
        }
        if(valid)
            break;
        valid = true;
    }

    fout << ans;

    delete []arr2;
    delete []arr1;
    return 0;
}