#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
typedef long long int llint;
const int INF = 1000000;
const llint LINF = 100000000;

int main(){
	int A[1500];
	int B[1500];
	int n,ans = INF;
	priority_queue<pair<int, int>>st;
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> A[i];
		st.push(make_pair(-A[i],0));
	}
	for (int i = 0; i < n; i++){
		cin >> B[i];
	}
	for (int i = 0; i < n; i++){
		int cc = 0;
		priority_queue<pair<int, int>>pq = st;
		for (int j = i; j < n+i; j++){
			
			pair<int, int> P = pq.top();
			pq.pop();
			P.second--;
			if (j < n){
				P.first -= B[j] / 2;
			}
			else{
				P.first -= B[j - n] / 2;
			}
				pq.push(P);
				cc = max(cc, -P.second);
		}
		ans = min(cc, ans);
	}
	cout << ans << endl;
	return 0;

}