void main() {
	const N = readInt;
	auto A = new int[N];
	foreach (i; 0 .. N) A[i] = readInt;
	auto B = new int[N];
	foreach (i; 0 .. N) B[i] = readInt;
	int ans = N;
	alias Entry = Tuple!(int, "l", int, "c");
	foreach (i; 0 .. N) {
		auto Q = new BinaryHeap!(Array!Entry, "a > b");
		foreach (j; 0 .. N) {
			Q.insert(Entry(A[j], 0));
		}
		int now;
		foreach (j; 0 .. N) {
			Entry x = Q.front;
			Q.removeFront;
			Q.insert(Entry(x.l + B[(i + j) % N] / 2, x.c + 1));
			chmax(now, x.c + 1);
		}
		chmin(ans, now);
	}
	ans.writeln;
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}