#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

const ll INF=1LL<<60;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin>>N;
    vector<ll>X(N),A(N);
    for(int i=0;i<N;i++)cin>>X[i];
    for(int i=0;i<N;i++)cin>>A[i];
    vector<ll>S(N+1);
    for(int i=0;i<N;i++)S[i+1]=S[i]^A[i];
    vector dp(N+1,vector<ll>(N+1,INF));
    vector flag(N+1,vector<bool>(N+1));
    auto f=[&](auto f,int l,int r)-> ll {
        if(flag[l][r])return dp[l][r];
        if(l==r)return 0LL;
        flag[l][r]=true;
        chmin(dp[l][r],f(f,l+1,r)+A[l]);
        chmin(dp[l][r],f(f,l,r-1)+A[r-1]);
        chmin(dp[l][r],(S[r]^S[l])+X[r-1]-X[l]);
        return dp[l][r];
    };
    cout<<f(f,0,N)<<"\n";
}