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

int main() {

	int n; cin >> n;
	vector<int> a, b;
	vector<int> bi(n);
	for (int i = 0; i < n; i++) {
		cin >> bi[i];
	}
	
	for (int i = 0; i < n; i++) {
		int x; cin >> x;
		((bi[i] == 0) ? a : b).push_back(x);
	}
	
	int aSize = (int) a.size(), bSize = (int) b.size();
	vector<int> prefa(aSize + 1), prefb(bSize + 1);
	for (int i = 0; i < aSize; i++) {
		prefa[i + 1] = prefa[i] + a[i];
	}

	for (int i = 0; i < bSize; i++) {
		prefb[i + 1] = prefb[i] + b[i];
	}

	vector<vector<int>> dp(aSize + 1, vector<int>(bSize + 1, -1));
	dp[0][0] = 0;
	for (int i = 0; i < aSize; i++) {
		for (int j = 0; j < bSize; j++) {
			int mmm = max(a[i], b[j]);

			int mini = INT_MAX;
			for (int k = 0; k <= i; k++) { // a balra első
				for (int l = 0; l <= j; l++) { // b balra első
					if (dp[k][l] == -1) continue;
					int awaiting = mmm * (i - k + 1) - (prefa[i + 1] - prefa[k]);
					int bwaiting = mmm * (j - l + 1) - (prefb[j + 1] - prefb[l]);
					mini = min(mini, dp[k][l] + awaiting + bwaiting);
				}
			}
			dp[i + 1][j + 1] = mini;
		}
	}
	cout << dp[aSize][bSize] << endl;
	
	return 0;
}