#include <bits/stdc++.h>
#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, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;

ll N, K, W, H, M, C, V;

const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

vector<double> cx, cy, c;
 ll MM = 1e12;

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

bool prime(int n){
    if (n == 1)return false;
    for(int i = 2; i*i <= n; ++i){
        if(n%i == 0) return false;
    }
    return true;
}

int main(){
    cin >> N;
    priority_queue<pair<ll, ll>> monst;
    REP(i, N) {
        ll level; cin >> level; monst.push(make_pair(-level, 0));
    }
    vector<ll> enemy(N);
    REP(i,N) cin >> enemy[i];
    ll res = 1e7;
    for(int i = 0; i < N; ++i){
        priority_queue<pair<ll, ll>> que = monst;
        for(int j = 0; j < N; ++j){
            pair<ll, ll> fm = que.top();
            que.pop();
            pair<ll, ll> aft = make_pair(fm.first - enemy[(i + j)%N]/2 , fm.second - 1);
            que.push(aft);
        }
        ll ret = 0;
        for(int i = 0; i < N ; ++i){
            ret = max(ret, -que.top().second);
            que.pop();
        }
        res = min(res, ret);
    }
    cout << res;
    return 0;
}