#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n; cin >> n;
    int a[n] = {};
    rep(i,n) cin >> a[i];
    int b[n] = {};
    rep(i,n) cin >> b[i];

    int ans = 1001001;

    rep(i,n){
        P p;
        priority_queue<P,vector<P>,greater<P>> que;

        rep(j,n){
            p.first = a[j];
            p.second = 0;
            que.push(p);
        }

        rep(j,n){
            p = que.top();
            que.pop();
            p.first += b[(i+j)%n]/2;
            p.second++;
            que.push(p);
        }

        int tmp = 0;
        while(que.size() > 0){
            p = que.top();
            que.pop();
            tmp = max(tmp, p.second);
        }
        ans = min(ans, tmp);
    }

    cout << ans << endl;
    return 0;
}