// yukicoder: No.9 モンスターのレベル上げ
// bal4u 2019.8.18

#include <stdio.h>
#include <string.h>

//// 入出力関係
#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() { // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

//// 優先度付き（最小）キュー

#define MAX 10000
int que[MAX]; int qsize;
int qcp[MAX]; int qsz;

#define PARENT(i) ((i)>>1)
#define LEFT(i)   ((i)<<1)
#define RIGHT(i)  (((i)<<1)+1)

void min_heapify(int i) {
	int l, r, mi;

	l = LEFT(i), r = RIGHT(i);
	if (l < qsize && que[l] < que[i]) mi = l; else mi = i;
	if (r < qsize && que[r] < que[mi]) mi = r;
	if (mi != i) {
		int qt = que[i]; que[i] = que[mi]; que[mi] = qt;
		min_heapify(mi);
	}
}

void deq() {
	que[0] = que[--qsize];
	min_heapify(0);
}

void enq(int a) {
	int i, mi;

	i = qsize++;
	que[i] = a;
	while (i > 0 && que[i] < que[mi = PARENT(i)]) {
		int qt = que[i]; que[i] = que[mi]; que[mi] = qt;
		i = mi;
	}
}

//// 本問題関連
#define SFT  11
#define MASK 2047  // 2^11-1
int N;
int a[1503], b[1503];

int main()
{
	int i, j, k, t, ans;

	N = in();
	for (i = 0; i < N; i++) a[i] = in();
	for (i = 0; i < N; i++) b[i] = in() >> 1;
	if (N == 1) { puts("1"); return 0; }
	
	ans = N;
	qsize = 0;
	for (i = 0; i < N; i++) enq(a[i] << SFT);
	qsz = qsize, memcpy(qcp, que, sizeof(int)*qsz);

	for (i = 0; i < N; i++) {
		if (i) qsize = qsz, memcpy(que, qcp, sizeof(int)*qsz);
		t = 0, k = i, j = N; while (j--) {
			int x = que[0] >> SFT, y = (que[0] & MASK)+1; deq();
			enq(((x + b[k]) << SFT) | y);
			if (y > t) t = y;
			if (++k == N) k = 0;
		}
		if (t < ans) { ans = t; if (ans == 1) break; }
	}
	printf("%d\n", ans);
	return 0;
}