#include<bits/stdc++.h>
//#include<cstdio>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define int long long
typedef long long ll;
#define F first
#define S second
#define pb emplace_back
int a[5005],b[5005],pre[5005],xo[5005];
int dp[5005];
signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    int sum=0;
    for(int i=1;i<=n;i++) sum+=b[i];
    for(int i=1;i<=n;i++)
    {
        xo[i]=xo[i-1]^b[i];
        pre[i]=pre[i-1]+b[i];
    }
    for(int i=1;i<=n;i++)
    {
        dp[i]=(pre[i]-xo[i])-(a[i]-a[1]);
        for(int j=2;j<=i;j++)
        {
            dp[i]=max(dp[i],(pre[i]-pre[j-1]-(xo[i]^xo[j-1]))-(a[i]-a[j])+dp[j-1]);
        }
    }
    cout<<sum-dp[n]<<'\n';









}