#include<bits/stdc++.h>
using namespace std;
const int N=21;
long long n;
long long a[N],b[N],c[N];
long long dfs(long long k,long long ans){
	if(k==n+1){
		return ans;
	}
	return max(dfs(k+1,ans^a[k]),dfs(k+1,ans^b[k]));
}
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];
	cout<<dfs(1ll,0ll);
	return 0;
}