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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> a(n), b(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        for (int i = 0; i < n; i++) {
            cin >> b[i];
        }

        constexpr int inf = 1e9;
        int ans = inf;

        for (int i = 0; i < n; i++) {
            priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> h;
            for (int j = 0; j < n; j++) {
                h.emplace(a[j], 0);
            }
            int res = 0;
            for (int j = 0; j < n; j++) {
                auto [x, c] = h.top();
                h.pop();
                h.emplace(x + b[(i + j) % n] / 2, c + 1);
                res = max(res, c + 1);
            }
            ans = min(ans, res);
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}