#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, A[1510], B[1510];
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i];
    for (int i = 0; i < N; i++) {
        cin >> B[i];
        B[i] /= 2;
    }

    int ans = 1510;
    for (int start = 0; start < N; start++) {
        int MAX = 0;
        priority_queue<pair<int, int>,
            vector<pair<int, int>>,
            greater<pair<int, int>>>
            que;
        for (int i = 0; i < N; i++)
            que.push({A[i], 0});
        for (int i = 0; i < N; i++) {
            int x = (i + start) % N;
            auto p = que.top();
            que.pop();
            p.first += B[x];
            p.second++;
            MAX = max(MAX, p.second);
            que.push(p);
        }
        ans = min(ans, MAX);
    }
    cout << ans << endl;
}