#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

struct monster{
    int index;
    int level;
    int attack;
    friend bool operator<(const monster&m1, const monster&m2){
        if(m1.level != m2.level) return m1.level > m2.level;
        return m1.attack > m2.attack;
    }
};

int main()
{
    int N;
    cin>>N;
    VI A(N), B(N);
    FOR(i,N) scanf("%d",&A[i]);
    FOR(i,N) scanf("%d",&B[i]);
    int ans = 1<<28;
    FOR(start,N){
        priority_queue<monster> qu;
        FOR(i,N) {
            qu.push((monster){ i, A[i], 0 });
        }
        int maxAttack = 0;
        FOR(i,N){
            int targetLevel = B[(start + i) % N];
            monster m = qu.top(); qu.pop();
            m.level += targetLevel / 2;
            m.attack++;
            maxAttack = max(maxAttack, m.attack);
            qu.push(m);
        }
        ans = min(ans, maxAttack);
    }
    cout<<ans<<endl;
    return 0;
}