#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 10000


int main(){
    int n,ans=INF;
    int A[SIZE],B[SIZE];
    priority_queue<pair<int,int> > st;
    
    
    scanf("%d",&n);

    for(int i=0;i<n;i++){
        scanf("%d",&A[i]);
        
        st.push(make_pair(-A[i],0));
    }
    
    for(int i=0;i<n;i++)
        scanf("%d",&B[i]);
    
    for(int i=0;i<n;i++){
        priority_queue<pair<int,int> > pq =st;
        int cc=0;
        
        for(int j=0;j<n;j++){
            
            pair<int,int> p = pq.top();
            pq.pop();
            
            p.second--;
            p.first-=B[(i+j)%n]/2;
            
            cc = max(cc,-p.second);
            
            pq.push(p);
        }
        
        ans = min(ans,cc);
    }
    
    cout << ans << endl;
    
    return 0;
}