#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

int main() {
    int n; cin >> n;
    typedef pair<ll, int> P;
    priority_queue<P, vector<P>, greater<P>> pq,tmp;
    vector<ll> a(n), b(2*n);
    REP(i, n) {
        cin >> a[i];
        tmp.push({a[i],0});
    }
    REP(i, n) {
        cin >> b[i];
        b[i] /= 2;
        b[i + n] = b[i];
    }
    int ans = INF;
    REP(i, n) {
        pq = tmp;
        int m = 0;
        REP(j, n) {
            P p = pq.top(); pq.pop();
            pq.push({p.first + b[i + j],p.second + 1});
            m = max(m, p.second + 1);
        }
        ans = min(ans, m);
    }
    cout << ans << endl;
    getchar(); getchar();
}