//No.9 モンスターのレベル上げ
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <cstring>
#define N_MAX 1500
using namespace std;

int N;

typedef struct
{
	int Level;
	int Count;
} FM;

bool compFm(const FM& x, const FM& y)
{
	if (x.Level != y.Level)
		return x.Level < y.Level;
	else
		return x.Count < y.Count;
}

bool compC(const FM& x, const FM& y)
{
	return x.Count > y.Count;
}

void swap(FM& x, FM& y)
{
	FM t = y;
	y = x;
	x = t;
}

void resort_old(FM* fm)
{
	for (int i = 0; i < N - 1; ++i)
		if (fm[i].Level > fm[i + 1].Level ||
			(fm[i].Level == fm[i + 1].Level && fm[i].Count > fm[i + 1].Count))
			swap(fm[i], fm[i + 1]);
}

void resort(FM* fm)
{
	FM t = fm[0];
	for (int i = 1; i < N; ++i)
	{
		if (t.Level > fm[i].Level
			|| (t.Level == fm[i].Level
			&& t.Count > fm[i].Count)
			)
			continue;
		--i;
		memcpy(fm, fm + 1, sizeof(FM)*i);
		fm[i] = t;
		return;
	}
	memcpy(fm, fm + 1, sizeof(FM)*(N-1));
	fm[N-1] = t;
}

int main()
{
	FM A[N_MAX], AA[N_MAX];
	int B[N_MAX];
	int ans = INT_MAX;
	cin >> N;

	std::memset(A, 0, sizeof(A));

	for (int i = 0; i < N; ++i)
	{
		cin >> A[i].Level;
	}
	for (int i = 0; i < N; ++i)
		cin >> B[i];
	sort(A, A + N, compFm);

	//最初の敵選択ループ
	for (int f = 0; f < N; ++f)
	{
		std::memcpy(AA, A, sizeof(FM)*N);

		for (int i = 0; i < N; ++i)
		{
			int t = (f + i) % N;
			AA[0].Level += B[t] / 2;
			++(AA[0].Count);
			resort(AA);
		}
		sort(AA, AA + N, compC);
		if (AA[0].Count < ans)
			ans = AA[0].Count;
	}

	cout << ans << endl;

	return 0;
}