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

int main() {
	int n;
	cin >> n;
	vector<int> a(n), b(n);
	for (int i = 0;i < n;i++) {
		cin >> a[i];
	}
	for (int i = 0;i < n;i++) {
		cin >> b[i];
	}

	int ans = 1000000000;
	for (int i = 0;i < n;i++) {
		priority_queue<pair<int, int>> q;
		for (int i = 0;i < n;i++) {
			q.push(make_pair(-a[i], 0));
		}
		for (int j = 0;j < n;j++) {
			int index = (i + j) % n;
			auto qt = q.top();q.pop();
			q.push(make_pair(qt.first - (b[index] / 2), qt.second - 1));
		}
		int ma = -1;
		for (int j = 0;j < n;j++) {
			auto qt = q.top();q.pop();
			ma = max(ma, -qt.second);
		}
		ans = min(ans, ma);
	}
	cout << ans << endl;







	return 0;
}