#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
typedef long long LL;
LL a[N],b[N],c[N],mx;
LL dfs(LL r,LL x,LL n){
    if(r>n){
        return x;
    }
    if(c[r]==1){
        LL ca=dfs(r+1,x^a[r],n);
        LL cb=dfs(r+1,x^b[r],n);
        return max(ca,cb);
    }else{
        LL ea=dfs(r+1,x^a[r],n);
        LL eb=dfs(r+1,x^b[r],n);
        return min(ea,eb);
    }
}
int main(){
    freopen("mirror.in","r",stdin);
    freopen("mirror.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); 
    int n;
    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];
    LL mx=dfs(1,0,n);
    cout<<mx;
    return 0;
}