#include <bits/stdc++.h>

using namespace std;

void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    fast_io();
    int n;
    cin >> n;
    vector<long long> x(n), a(n), x_cum(n + 1), a_cum(n + 1);
    for (int i = 0; i < n; i++) {
        cin >> x[i];
        x_cum[i + 1] = x_cum[i] + x[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a_cum[i + 1] = a_cum[i] ^ a[i];
    }
    const long long INF = 1e18;
    vector<vector<long long>> score(n + 1, vector<long long>(n + 1, INF));
    for (int l = 0; l < n; l++) {
        for (int r = l + 1; r <= n; r++) {
            // [l, r)
            // 全てまとめる場合
            score[l][r] = a_cum[r] ^ a_cum[l];
            int med = (l + r) / 2;
            score[l][r] += (x_cum[r] - x_cum[med]) - (r - med) * x[med] +
                           (med - l) * x[med] - (x_cum[med] - x_cum[l]);
        }
    }
    vector<long long> dp(n + 1, INF);
    dp[0] = 0;
    for (int r = 1; r <= n; r++) {
        for (int l = 0; l < r; l++) {
            dp[r] = min(dp[r], dp[l] + score[l][r]);
        }
    }
    cout << dp[n] << endl;
}