#include <iostream>
#include<vector>
#include <utility>
#include <queue>
using namespace std;
#define MP make_pair
using PII = pair<int,int>;

int main() {
	int N; cin >> N;
	vector<int> xs(N);
	for(int i=0;i<N;++i) cin >> xs[i];
	vector<int> ys(N*2);
	for(int i=0;i<N;++i){
	 cin >> ys[i];
		ys[i+N] = ys[i];
	}
	
	int ans = 1e9;
	for(int i=0;i<N;++i){
		priority_queue<PII,vector<PII>,greater<PII>> pq;
		for(int i=0;i<N;++i) pq.push(MP(xs[i], 0));
		for(int j=0;j<N;++j){
			auto p = pq.top(); pq.pop();
			p.first += ys[i+j]/2;
			p.second++;
			pq.push(p);
		}
		int mx = 0;
		while(!pq.empty()){
			mx = max(mx, pq.top().second);
			pq.pop();
		}
		ans = min(ans, mx);
	}
	cout << ans << endl;
	
	return 0;
}