#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;
	vector<int> a(n), b(n*2);
	rep(i, n) cin >> a[i];
	rep(i, n) cin >> b[i];
	rep(i, n) b[i + n] = b[i];

	int ans = 1e9;
	rep(i, n){
		priority_queue<P, vector<P>, greater<P>> q;
		rep(j, n) q.push(MP(a[j], 0));
		FOR(j, i, i + n){
			auto p = q.top();
			q.pop();
			p.first += b[j] / 2;
			p.second++;
			q.push(p);
		}
		int Max = 0;
		while(!q.empty()){
			auto p = q.top();
			q.pop();
			Max = max(Max, p.second);
		}
		ans = min(ans, Max);
	}

	cout << ans << endl;

	return 0;
}