#include<iostream>
#include<queue>


using namespace std;

#define p pair<int,int>


int main() {
	int n;
	int i, j;
	int ans;
	cin >> n;
	vector<int>a(n);
	vector<int>b(n);
	b = vector<int>(n);
	for (int i = 0; i<n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i<n; i++) {
		cin >> b[i];
	}
	ans = n;
	for (i = 0; i<n; i++) {
		int t = 0;
		priority_queue<p, vector<p>, greater<p>> pq;
		for (j = 0; j<n; j++) {
			pq.push(p(a[j], 0));
		}
		for (j = 0; j<n; j++) {
			p m = pq.top();
			pq.pop();
			m.first += b[(i + j) % n] / 2;
			++m.second;
			t = max(t, m.second);
			pq.push(m);
		}
		ans = min(ans, t);
	}
	cout << ans << endl;
	return 0;
}