#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

struct S {
    ll val, cnt;
    
    bool operator<(const S &b) const {
        if (val == b.val) return cnt > b.cnt;
        return val > b.val;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<ll> a(n), b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];
    ll ans = LONG_LONG_MAX;
    rep(i, n) {
        priority_queue<S> pq;
        rep(j, n) pq.push((S){a[j], 0});
        rep(j, n) {
            S s = pq.top(); pq.pop();
            s.cnt++;
            s.val += b[(i + j) % n] / 2;
            pq.push(s);
        }
        ll tmp = 0;
        while(!pq.empty()) {
            tmp = max(tmp, pq.top().cnt);
            pq.pop();
        }
        ans = min(ans, tmp);
    }
    cout << ans << endl;
    return 0;
}