#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    vector<int> A(N), B(N);
    rep(i,N) cin >> A[i];
    rep(i,N) cin >> B[i];

    int ans = 1e9;
    rep(s,N) {
        priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
        rep(i,N) pq.push({A[i], 0});
        rep(i,N) {
            pair<int,int> x = pq.top(); pq.pop();
            x.first += B[(s + i) % N] / 2;
            x.second++;
            pq.push(x);
        }
        int cur = 0;
        rep(i,N) {
            pair<int,int> x = pq.top(); pq.pop();
            cur = max(cur, x.second);
        }
        ans = min(ans, cur);
    }
    cout << ans << endl;
}