#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())



int main(){
	int n,a[1500],b[1500];
	cin>>n;
	rep(i,n)cin>>a[i];
	rep(i,n)cin>>b[i];
	int ans=INF;
	rep(i,n){
		int maxlv=0;
		priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > pq;
		rep(j,n)pq.push(make_pair(a[j],0));
		pair<int,int> pi;
		for(int j=i;j<n;j++){
			pi=pq.top();
			pq.pop();
			pi.first+=b[j]/2;
			pi.second++;
			pq.push(pi);
			maxlv=max(maxlv,pi.second);
		}
		for(int j=0;j<i;j++){
			pi=pq.top();
			pq.pop();
			pi.first+=b[j]/2;
			pi.second++;
			pq.push(pi);
			maxlv=max(maxlv,pi.second);
		}
		ans=min(ans,maxlv);
	}
	cout<<ans<<endl;
	return 0;
}