#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct E{
	long long int count;
	long long int level;
	bool operator<(const E& e)const{
		if(level!=e.level)return level>e.level;
		return count>e.count;
	}
};

long long int xs[1501];
priority_queue<E> pq;
vector<E> vs;

int main() {
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		E e;
		e.count=0;
		cin>>e.level;
		vs.push_back(e);
	}
	for(int i=0;i<n;i++){
		cin>>xs[i];
	}
	int ans=n;
	for(int s=0;s<n;s++){
		int ans2=0;
		for(int i=0;i<n;i++){
			pq.push(vs[i]);
		}
		for(int i=0;i<n;i++){
			E e=pq.top();
			pq.pop();
			e.count+=1;
			e.level+=xs[(s+i)%n]/2;
			pq.push(e);
			if(ans2<e.count)ans2=e.count;
			//cout<<e.count<<" "<<e.level<<endl;
		}
		//cout<<ans2<<endl;
		if(ans>ans2)ans=ans2;
		while(pq.size()>0){
			pq.pop();
		}
	}
	cout<<ans<<endl;
	return 0;
}