#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;


class Yuki0009
{
public:
    void solve(void)
    {
            int N;
            cin>>N;

            vector<int> A(N);
            vector<int> B(N);

            REP(i,N) cin>>A[i];
            REP(i,N) cin>>B[i];

            int maxCnt = 1<<30;
            REP(i,N)
            {
                auto level(A);
                vector<int> cnt(N,0);

                auto cmp = [&](int a, int b){
                    if ( level[b] < level[a] )
                        return true;
                    if ( level[b] == level[a] )
                        return cnt[b] < cnt[a];
                    return false;
                };
                priority_queue<int, vector<int>, decltype(cmp)> que(cmp);
                REP(j,N) que.push(j);

                int k = i;
                REP(j,N)
                {
                    auto l = que.top();
                    que.pop();
                    level[l] += B[k]/2;
                    ++cnt[l];
                    que.push(l);
                    k = (k+1)%N;
                }
                int mx = *max_element(RANGE(cnt));
                if ( mx < maxCnt )
                    maxCnt = mx;
            }
            cout<<maxCnt<<endl;
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new Yuki0009();
        obj->solve();
        delete obj;
        return 0;
}
#endif