#include <iostream>
//#include<atcoder/all>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> 
#include <vector>
#include <algorithm>
#include <utility> 
#include <tuple> 
#include <cstdint> 
#include <cstdio> 
#include <map> 
#include <queue>
#include <set> 
#include <stack> 
#include <deque> 
#include <unordered_map> 
#include <unordered_set>
#include <bitset> 
#include <cctype>
//using namespace atcoder;
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<vector<pair<ll, ll>>>>;

int main() {
	ll N;
	cin >> N;
	vll A(N), B(N);
	rep(i, N) {
		cin >> A[i];
	}
	rep(i, N) {
		cin >> B[i];
	}
	ll an = 1e18;
	rep(i, N) {
		priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;
		rep(k, N) {
			Q.push(make_pair(A[k], ll(0)));
		}
		ll j = 0;
		rep(k, N) {
			auto p = Q.top();
			Q.pop();
			Q.push(make_pair(p.first + B[(k + i) % N] / 2, p.second + 1));
			j = max(j, p.second + 1);
		}

		an = min(an, j);



	}
	cout << an << endl;
}