#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
int main(){
    int n;cin>>n;
    int a[1510],b[1510];
    int ans=INF;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    for(int i=0;i<n;i++){
		priority_queue<P,vector<P>,greater<P>> q;
		for(int j=0;j<n;j++){
			q.push(P(a[j],0));
		}
		for(int j=i;j<i+n;j++){
			int p=j%n;
			P c=q.top();
			q.pop();
			c.first+=b[p]/2;
			c.second++;
			q.push(c);
		}
		int ma=0;
		while(!q.empty()){
			P p=q.top();q.pop();
			ma=max(p.second,ma);
		}
		ans=min(ans,ma);
	}
	cout<<ans<<endl;
    return 0;
}