#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
#include <numeric>
#include <memory>
#include <limits.h>
#include <set>
#include <cassert>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
using namespace std;

typedef long long ll;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define ALL(v) (v).begin(), (v).end()

int main(){
	ll n;
	cin >>  n;
	vector<ll> a(n);
	vector<ll> b(n);
	for (auto&i : a) cin >> i;
	for (auto&i : b) cin >> i;
	using P = pair<ll, ll>;
	ll min_c = 1501;
	REP(start, n){
		priority_queue<P, vector<P>, greater<P>> que;
		for (auto&i : a) que.push({i, 0});
		REP(i, n) {
			ll j = (i + start) % n;
			P p = que.top(); que.pop();
			que.push({p.first+b[j]/2, p.second+1});
		}
		priority_queue<ll> max_c;
		while(!que.empty()) { max_c.push(que.top().second); que.pop(); }
		min_c = min(min_c, max_c.top());
	}

	cout << min_c << endl;
	return 0;
}