#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<P> a(n);
  rep(i, n) cin >> a[i].first;
  rep(i, n) cin >> a[i].second;
  sort(all(a));
  VL s(n + 1);
  rep(i, n) s[i+1] = s[i] + a[i].first;
  constexpr long long INF = 1002003004005006007;
  VL dp(n + 1, INF);
  dp[0] = 0;
  rep(i, n) {
    int x = 0;
    for (int j = i + 1; j <= n; j++) {
      x ^= a[j-1].second;
      int c = (i + j) / 2;
      int ac = a[c].first;
      ll v = dp[i] + x + (s[j] - s[c] - ll(j - c) * ac) + (ll(c - i) * ac - (s[c] - s[i]));
      chmin(dp[j], v);
    }
  }
  cout << dp[n] << '\n';
}