#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int n; scanf("%d", &n);
	vector<int> a(n); for (int i = 0; i < n; i++) scanf("%d", &a[i]);
	vector<int> b(n); for (int i = 0; i < n; i++) scanf("%d", &b[i]);
	int res = inf;
	for (int s = 0; s < n; s++) {
		vector<int> c; c.reserve(n);
		for (int i = s; i < n; i++) c.emplace_back(b[i]);
		for (int i = 0; i < s; i++) c.emplace_back(b[i]);
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
		for (int i = 0; i < n; i++) pq.emplace(a[i], 0);
		for (int i = 0; i < n; i++) {
			auto p = pq.top();
			pq.pop();
			p.first += c[i] / 2;
			p.second += 1;
			pq.emplace(p);
		}
		int ans = 0;
		while (!pq.empty()) {
			chmax(ans, pq.top().second);
			pq.pop();
		}
		chmin(res, ans);
	}
	cout << res << endl;
	return 0;
}