#include<cstdio>
#define N 25
#define ll long long
using namespace std;
int n,c[N];ll a[N],b[N],ans;
ll max(ll x,ll y){return x>y?x:y;} 
void dfs(int i,ll x)
{
	if(i>n){ans=max(ans,x);return;}
	dfs(i+1,x^a[i]);
	dfs(i+1,x^b[i]);
}
int main(){
	freopen("mirror.in","r",stdin);freopen("mirror.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%lld",a+i);
	for(int i=1;i<=n;i++)scanf("%lld",b+i);
	for(int i=1;i<=n;i++)scanf("%d",c+i);
	dfs(1,0);
	printf("%lld",ans);
	return 0;
}