#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;

int main() {
    int n;
    cin >> n;
    using ii = pair<int, int>;
    priority_queue<ii, vector<ii>, greater<ii>> que;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        que.push(ii(a, 0));
    }

    deque<int> bs;
    for (int i = 0; i < n; i++) {
        int b;
        cin >> b;
        bs.push_back(b);
    }

    int ans = -1;
    for (int i = 0; i < n; i++) {
        priority_queue<ii, vector<ii>, greater<ii>> q(que);
        for (int j = 0; j < n; j++) {
            ii m = q.top();
            q.pop();
            m.first += bs[j] / 2;
            m.second++;
            q.push(m);
        }
        int tmp = -1;
        while (q.size()) {
            tmp = max(tmp, q.top().second);
            q.pop();
        }
        ans = max(ans, tmp);
        bs.push_back(bs.front());
        bs.pop_front();
    }   
    cout << ans << endl;
}