#include <bits/stdc++.h>
using namespace std;

//macro-----------------------------------------------------------------------------------------
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int long long
const int inf = 100100100100000;
const int mod = 1000000007;

//general_method--------------------------------------------------------------------------------
vector<int> cs(vector<int> arr){vector<int> ret = arr;rep(i,1,arr.size()){ret[i] += ret[i-1];}return ret;}
int ceil(int a, int b){if(a%b == 0) return a/b;else return a/b + 1;}
int digitlen(int i){int t = i;int count = 0;while(t){count += 1;t /= 10;}return count;}
int gcd(int m, int n){if((0== m)||(0 == n))return 0;while(m != n){if(m > n)m = m - n;else n = n - m;}return m;}
int lcm(int n, int m){return n*m/gcd(n,m);}

//io_method-------------------------------------------------------------------------------------
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
void print(int n){cout << n << endl;}
void print(vector<int> arr){cout << arr[0];rep(i,1,arr.size()) cout << " " << arr[i];cout << endl;}
void print(string s){cout << s << endl;}
void print(pair<int, int> p){cout << p.first << " " << p.second;}

//main_method-----------------------------------------------------------------------------------
auto c = [](pair<int, int> l, pair<int,int> r) { if(l.second != r.second) return l.second > r.second; else return l.first > r.first;};

signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int n = input();
    vector<int> levels; rep(i,0,n) levels.push_back(input());
    vector<int> monsters; rep(i,0,n) monsters.push_back(input());

    int ans = inf;
    rep(i,0,n){
        priority_queue<pair<int, int>,vector<pair<int, int>>, decltype(c) > q(c);
        rep(i,0,n) q.push(make_pair(0, levels[i]));
        rep(j,0,n){
            pair<int, int> t = q.top(); q.pop();
            t.first += 1; t.second += monsters[(i+j)%n]/2;
            q.push(t);
        }

        int cnt = 0;
        while(not q.empty()){
            cnt = max(cnt, q.top().first);
            q.pop();
        }
        ans = min(ans, cnt);

    }
    print(ans);



}