#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	vector<ll> x(n), a(n);
	rep(i,0,n){
		cin >> x[i];
	}
	rep(i,0,n){
		cin >> a[i];
	}

	vector xors(n+1, vector<ll>(n+1));
	vector cost(n+1, vector<ll>(n+1, 1e18));
	vector<ll> rui(n + 1);
	rep(i,0,n){
		rui[i + 1] = rui[i] + x[i];
	}

	rep(i,0,n){
		ll tmp = 0;
		rep(j,i,n){
			tmp ^= a[j];
			xors[i][j+1] = tmp;
		}
	}

	rep(i,0,n){
		rep(j,i+1,n+1){
			int v = (j-i) / 2 + i;
			cost[i][j] = x[v] * (v-i) - (rui[v] - rui[i]);
			cost[i][j] += (rui[j] - rui[v]) - x[v] * (j-v);
		}
	}

	vector<ll> dp(n+1, 1e18);
	dp[0] = 0;
	rep(i,1,n+1){
		rep(j,0,i){
			chmin(dp[i], dp[j] + cost[j][i] + xors[j][i]);
		}
	}
	cout << dp[n] << '\n';
}