#include<bits/stdc++.h>
using namespace std;

#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl;
typedef long long int ll;

int calc(vector<int> &ev,vector<int> &mv,int offset){
    priority_queue<pair<int,int>> pq;
    for (int e:mv)
        pq.push(make_pair(-e,0));
    
    int i,j,max=0;
    for (j=0;j<ev.size();j++){
        i=(j+offset)%ev.size();
        int p=-pq.top().first;
        int q=-pq.top().second;pq.pop();
        p+=ev[i]/2;
        if (max<++q) max=q;
        pq.push(make_pair(-p,-q));
    }
    return max;
}

int main(){
    int i,j,k,l;
    int x,y,d;
    int n,m;
    
    cin >> n;
    vector<int> mee(n);
    vector<int> ene(n);
    
    for (i=0;i<n;i++){
        scanf("%d",&j);
        mee[i]=j;
    }
    for (i=0;i<n;i++){
        scanf("%d",&j);
        ene[i]=j;
    }
    
    int min=0xFFFF;
    for (i=0;i<n;i++){
        int u=calc(ene,mee,i);
        if (min>u) min=u;
    }
    cout<<min<<endl;
    
    
    return 0;
    
}