#include<bits/stdc++.h>
using namespace std;
int n, ming[1000010], mi[1000010], key[1000010];
map<int, int >mp;
int main()
{
    freopen("XORcipher.in", "r", stdin);
    freopen("XORcipher.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &ming[i]);
        mp[ming[i]] = 1;
    }
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &mi[i]);
        key[i] = mi[i] ^ ming[1];
    }
    for(int i = 1; i <= n; i++)
    {
        bool p = 1;
        for(int j = 1; j <= n; j++)
        {
            int o = key[i] ^ mi[j];
            if(!mp[o])
            {
                p = 0;
                break;
            }
        }
        if(p)
        {
            printf("%d", key[i]);
            return 0;
        }
    }
}