#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <utility>
#include <functional>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl

using namespace std;

typedef long long int lli;
typedef pair<int, int> pii;

template<typename T>
vector<T> make_v(size_t a, T b) {
    return vector<T>(a, b);
}

template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

int main() {
    int N;
    cin >> N;
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    REP(i, 0, N) {
        int a;
        cin >> a;
        pq.emplace(a, 0);
    }
    vector<int> B(N);
    REP(i, 0, N) {
        cin >> B[i];
    }
    int ans = N;
    REP(i, 0, N) {
        auto pqt = pq;
        REP(j, 0, N) {
            int idx = (i + j) % N;
            auto elem = pqt.top();
            pqt.pop();
            elem.first += (B[idx] / 2);
            elem.second++;
            pqt.push(elem);
        }
        int tmp = 0;
        while (pqt.size()) {
            tmp = max(tmp, pqt.top().second);
            pqt.pop();
        }
        ans = min(ans, tmp);
    }
    cout << ans << endl;
    return 0;
}