#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
//const int MOD = 1000000007;
const int MOD = 998244353;

int main() {
	int n;
	cin >> n;
	vi a(n), b(n * 2);
	priority_queue<pii, vector<pii>, greater<pii>> pq_s;
	
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		pq_s.push({ a[i], 0 });
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
		b[i + n] = b[i];
	}
	int ans = inf;
	for (int i = 0; i < n; i++) {
		priority_queue<pii, vector<pii>, greater<pii>> pq = pq_s;
		int x = 0;

		for (int j = 0; j < n; j++) {
			pii p = pq.top();
			pq.pop();

			p.second++;
			x = max(x, p.second);
			p.first += b[i + j] / 2;
			pq.push(p);
		}
		ans = min(ans, x);

	}
	cout << ans << endl;
	
	return 0;
}