#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=50010;
ll n,x,a[N],b[N],c[N],ans;
void dfs (int idx) {
	if (idx>n) {
		ans=max(ans,x);
		return;
	}
    ll y=x; 
    x^=a[idx];
    dfs(idx+1);
    x=y;
    x^=b[idx];
    dfs(idx+1);
}
int main () {
	freopen("mirror.in","r",stdin);
	freopen("mirror.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0); 
	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 << ans <<endl;
	return 0;
}