#include <iostream>
#include <vector>
#include <queue>

int main() {
    int N;
    std::cin >> N;
    std::vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) { std::cin >> A.at(i); }
    for (int i = 0; i < N; i++) { std::cin >> B.at(i); }

    int ans = N;
    for (int i = 0; i < N; i++) {
        std::priority_queue<
                std::pair<int, int>,
                std::vector<std::pair<int, int>>,
                std::greater<std::pair<int, int>>> q;
        for (int j = 0; j < N; j++) { q.emplace(A.at(j), 0); }
        for (int j = 0; j < N; j++) {
            auto x = q.top();
            q.pop();
            int k = i + j;
            if (k >= N) { k -= N; }
            x.first += B.at(k) / 2;
            x.second += 1;
            q.emplace(x);
        }
        int tmp = 0;
        for (int j = 0; j < N; j++) {
            if (tmp < q.top().second) { tmp = q.top().second; }
            q.pop();
        }
        if (ans > tmp) { ans = tmp; }
    }
    std::cout << ans << std::endl;
}