#include <iostream>
#include <vector>
#include <utility>
#include <queue>
using namespace std;

typedef pair<int, int> P;

const int kINF = 1 << 28;
const int kMAX_N = 1510;

int N;
int A[kMAX_N], B[kMAX_N];

void Solve() {
    int answer = kINF;
    for (int i = 0; i < N; i++) {
        priority_queue<P, vector<P>, greater<P> > que;
        for (int m = 0; m < N; m++) {
            que.push(P(A[m], 0));
        }
        int max_fight = 0;
        for (int j = 0; j < N; j++) {
            int enemy = (i + j) % N;
            P monster = que.top(); que.pop();
            monster.first += B[enemy] / 2;
            monster.second += 1;

            que.push(monster);

            max_fight = max(max_fight, monster.second);
        }

        answer = min(answer, max_fight);
    }
    cout << answer << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N;

    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    for (int i = 0; i < N; i++) {
        cin >> B[i];
    }

    Solve();

    return 0;
}