#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n; cin >> n;
    vector<ll> x(n+1, 0), a(n+1, 0);
    for(int i=1; i<=n; i++) cin >> x[i];
    for(int i=1; i<=n; i++) cin >> a[i];

    vector<ll> asum(n+1, 0);
    for(int i=1; i<=n; i++){
        asum[i] = asum[i-1] ^ a[i];
    }

    vector<ll> dp(n+1, LINF);
    dp[0] = 0;
    for(int i=1; i<=n; i++){
        for(int j=i; j>=1; j--){
            dp[i] = min(dp[i], dp[j-1] + (asum[i]^asum[j-1]) + (x[i]-x[j]));
        }
    }

    cout << dp[n] << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}