#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> x(n);
  for (int& x_i : x) cin >> x_i;
  vector<ll> y(n + 1, 0);
  REP(i, n) y[i + 1] = y[i] + x[i];
  vector<int> a(n);
  for (int& a_i : a) cin >> a_i;
  vector<ll> dp(n + 1, LINF);
  dp[0] = 0;
  REP(i, n) {
    for (int j = i, xr = 0; j >= 0; --j) {
      xr ^= a[j];
      const int m = (i + j) / 2;
      chmin(dp[i + 1], dp[j] + xr + y[i + 1] - y[m] - x[m] * (i - m + 1LL) + x[m] * ll{m - j} - (y[m] - y[j]));
    }
  }
  cout << dp[n] << '\n';
  return 0;
}