#include <bits/stdc++.h>
#define N 50005
#define ll unsigned long long int
using namespace std;
int n, c[N];
ll a[N], b[N];
ll dfs(int cnt, ll x) {
    if (cnt == n + 1) return x;
    else {
        if (a[cnt] == b[cnt]) {
            return dfs(cnt + 1, x ^ a[cnt]);
        }
        if (c[cnt] == 1) {
            return max(dfs(cnt + 1, x ^ a[cnt]), dfs(cnt + 1, x ^ b[cnt]));
        }
        else {
            return min(dfs(cnt + 1, x ^ a[cnt]), dfs(cnt + 1, x ^ b[cnt]));
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    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(1, 0) << endl;
    return 0;
}