#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
#include <queue>
#include <map>
#include <cstring>
#include <algorithm>
#define INF 114514

using namespace std;

typedef pair<int,int> P;

int main(void){
	priority_queue<P,vector<P>,greater<P> > que,pq;	
	int n;
	cin >> n;
	vector<int> b(n);
	for(int i=0;i<n;i++){
		int a;cin >> a;
		pq.push(make_pair(a,0));
	}
	for(int i=0;i<n;i++)
		cin >> b[i];
	
	int ret = INF;
	for(int i=0;i<n;i++){
		que = pq;
		for(int j=0;j<n;j++){
			P p = que.top();que.pop();
			p.first += b[(i+j)%n]/2;
			p.second += 1;
			que.push(p);
		}

		int cnt = 0;
		while(!que.empty()){
			P p = que.top();que.pop();
			cnt = max(cnt,p.second);
			// cout << p.second << " ";
		}
		// cout << cnt << endl;
		ret = min(ret,cnt);
	}
	cout << ret << endl;
	return 0;
}