#include <bits/stdc++.h>
using namespace std;
int main(){
	auto compare=[](vector<int> a,vector<int> b){
		if(a[0]!=b[0]){
			return a[0]>b[0];
		}else{
			return a[1]>b[1];
		}
	};
	int N;
	scanf("%d",&N);
	int A[N],B[N];
	for(int i=0;i<N;++i){
		scanf("%d",&A[i]);
	}
	for(int i=0;i<N;++i){
		scanf("%d",&B[i]);
	}
	int ans=N;
	for(int i=0;i<N;++i){
		priority_queue<vector<int>,vector<vector<int>>,decltype(compare)>q {compare};
		int cand=0;
		for(int j=0;j<N;++j){
			q.push((vector<int>){A[j],0});
		}
		for(int j=0;j<N;++j){
			vector<int> temp=q.top();
			q.pop();
			temp[0]+=B[(i+j)%N]/2;
			++temp[1];
			if(cand<temp[1]){
				cand=temp[1];
			}
			q.push(temp);
		}
		if(ans>cand){
			ans=cand;
		}
	}
	printf("%d\n",ans);
}