#include <stdio.h>

void marge_sort(int[], int, int);
int win(int, int);

int n, a[1500], b[1500], level[1500], buttle[1500];

int main(void) {
	scanf("%d", &n);
	int i, j;
 	for(i = 0; i < n; i++) { scanf("%d", &a[i]); }
	for(i = 0; i < n; i++) { scanf("%d", &b[i]); b[i] /= 2; }
	
	marge_sort(a, 0, n - 1);
	
	int min = 1501;
	for(i = 0; i < n; i++) { // i: 開始位置
		for(j = 0; j < n; j++) {
			level [j] = a[j];
			buttle[j] = 0;
		}
		for(j = 0; j < n; j++) {
			level [0] += b[(i + j) % n];
			buttle[0]++;
			int p = 0;
			while(p + 1 < n && win(p, p + 1)) {
				int temp_l = level [p];
				int temp_b = buttle[p];
				level [p] =  level[p + 1];
				buttle[p] = buttle[p + 1];
				level [p + 1] = temp_l;
				buttle[p + 1] = temp_b;
				p++;
			}
		}
		int max = 0;
		for(j = 0; j < n; j++) {
			max = max < buttle[j] ? buttle[j] : max;
		}
		min = max < min ? max : min;
	}
	printf("%d\n", min);
	return 0;
}

void marge_sort(int x[], int l, int r) {
	if(l == r) { return; }
	int m = (l + r) / 2;
	marge_sort(x, l, m);
	marge_sort(x, m + 1, r);
	int p = l, q = m + 1, cnt = 0, copy[r - l + 1];
	while(1) {
		int flag;
		if(m < p && r < q) { break; }
		else if(r < q) { flag = 1; }
		else if(m < p) { flag = 0; }
		else { flag = ( x[p] <= x[q] ); }
		if(flag) {
			copy[cnt] = x[p];
			p++;
		} else {
			copy[cnt] = x[q];
			q++;
		}
		cnt++;
	}
	int i;
	for(i = 0; i < r - l + 1; i++) {
		x[l + i] = copy[i];
	}
	return;
}

int win(int p, int q) { // pの方が大きければ1
	if(level[q]  < level[p]) { return 1; }
	if(level[q] == level[p]) { return buttle[q] < buttle[p]; }
	return 0;
}