#include<iostream>
#include<queue> 

using namespace std;

int n;
int *a, *b;
int i,j;
int ans = 1 << 16;

void scan();
void solve();
int cnt(int index);
void write();

struct monstar
{
	int battle;
	int level;
};

struct temp :less<monstar>
{
	bool operator()(const monstar &a, const monstar &b) {
		if (a.level != b.level) {
			return a.level > b.level;
		}
		else
		{
			return a.battle < b.battle;
		}
	}
};

int main(void) {
	scan();
	solve();
	write();
	return 0;
}

void scan() {
	cin >> n;
	a = new int[n];
	b = new int[n];
	for (i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (i = 0; i < n; i++) {
		cin >> b[i];
	}
}

void solve() {
	for (j = 0; j < n; j++) {
		int a = cnt(j);
		if (a < ans) {
			ans = a;
		}
	}
}

void write() {
	cout << ans << endl;
}

int cnt(int index) {
	priority_queue<monstar, vector<monstar>, temp> q;
	for (i = 0; i < n; i++) {
		struct monstar add = { 0,a[i] };
		q.push(add);
	}
	for (i = index; i < n; i++) {
		monstar cp = q.top();
		q.pop();
		cp.battle++;
		cp.level += b[i] / 2;
		q.push(cp);
	}
	for (i = 0; i < index; i++) {
		monstar cp = q.top();
		q.pop();
		cp.battle++;
		cp.level += b[i] / 2;
		q.push(cp);
	}
	int max = 0;
	for (i = 0; i < n; i++) {
		monstar m = q.top();
		q.pop();
		if (max < m.battle) {
			max = m.battle;
		}
	}
	return max;
}