#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N, A[1500], B[1500];

int main(){
    cin >> N;
    rep(i, N)cin >> A[i];
    rep(i, N)cin >> B[i];

    int ans = INT_MAX;
    priority_queue<pii, vector<pii>, greater<pii> > q;
    rep(i, N){
        rep(j, N)q.push({A[j],0});
        rep(j, N){
            int k = (i + j) % N;
            pii p = q.top(); q.pop();
            p.first += B[k] >> 1;
            p.second++;
            q.push(p);
        }
        int ma = 0;
        while(sz(q))smax(ma, q.top().second), q.pop();
        smin(ans, ma);
    }
    cout << ans << endl;
}