#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
int n,a[N],b[N],c[N],ch[N],x1=0;
void dfs(int x)
{
    if(x==n+1)
    {
        int s=0;
        for(int i=1;i<=n;i++) s=s^ch[i];
        x1=max(x1,s);
        return;
    }
    ch[x]=a[x];
    dfs(x+1);
    ch[x]=b[x];
    dfs(x+1);
    ch[x]=0;
}
int main()
{
    freopen("mirror.in","r",stdin);
    freopen("mirror.out","w",stdout);
    
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=1;i<=n;i++) cin>>c[i];
    dfs(1);
    cout<<x1<<endl;
    return 0;
}