#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    deque<ll> b(n);
    rep(i, n) cin >> a[i]; 
    rep(i, n) cin >> b[i];
    auto calc = [&]() {
        using P = pair<ll, ll>;//lv,battle
        priority_queue<P,vector<P>,greater<P> > q;
        ll ret = 0LL;
        rep(i, n) q.push({a[i], 0LL});
        rep(i, n) {
            auto p = q.top();
            q.pop();
            p.fi += b[i]/2;
            p.se++;
            q.push(p);
            ret = max(ret, p.se);
        }
        return ret;
    };
    ll ans = 1e18;
    rep(i, n) {
        ans = min(ans, calc());
        auto t = b.front();
        b.pop_front();
        b.push_back(t);
    }
    cout << ans << '\n';
    return 0;
}