#include "bits/stdc++.h"

using namespace std;

const int INF = (1 << 30) - 1;

int solve(int n, vector<int> a, vector<int> b, priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> partyInfo) {
	int res = INF;
	for (int i = 0; i < n; i++) {
		int fightNumMax = 0;
		
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq = partyInfo;
		for (int j = 0; j < n; j++) {
			int now = (i + j < n ? i + j : i + j - n);

			pair<int, int> player = pq.top(); pq.pop();
			player.first += b[now] / 2;
			player.second++;

			fightNumMax = max(fightNumMax, player.second);
			pq.push(player);
		}
		res = min(res, fightNumMax);
	}

	return res;
}

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

	int n;
	cin >> n;

	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	vector<int> b(n);
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}

	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> partyInfo;
	for (int i = 0; i < n; i++) {
		partyInfo.push(make_pair(a[i], 0));
	}

	cout << solve(n, a, b, partyInfo) << endl;
	return 0;
}