#include <bits/stdc++.h>
using namespace std;

#define repu(i, a, b) for (int i = (a); i < (b); ++i)
#define repd(i, a, b) for (int i = (a); i > (b); --i)
#define mem(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define uni(a) a.erase(unique(all(a)), a.end())

typedef long long ll;
const int MOD = 1000000007;

template<class T, class U> inline T tmin(T a, U b) {return (a < b) ? a : b;}
template<class T, class U> inline T tmax(T a, U b) {return (a > b) ? a : b;}
template<class T, class U> inline void amax(T &a, U b) {if (b > a) a = b;}
template<class T, class U> inline void amin(T &a, U b) {if (b < a) a = b;}
template<class T> inline T tabs(T a) {return (a > 0) ? a : -a;}
template<class T> T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;}

typedef pair<int, int> P;
#define X first
#define Y second

const int N = 1505;
int n, a[N], b[N];

int main(int argc, char *argv[]) {
	ios_base::sync_with_stdio(false);
	
	cin >> n;
	repu(i, 0, n) cin >> a[i];
	repu(i, 0, n) cin >> b[i];
	
	int ret = n;
	repu(i, 0, n) {
		priority_queue<P, vector<P>, greater<P>> que;
		repu(j, 0, n) que.push(P(a[j], 0));
		int cnt = 0;
		repu(k, 0, n) {
			int ind = (i + k) % n;
			P p = que.top(); que.pop();
			p.X += b[ind] >> 1;
			p.Y++;
			amax(cnt, p.Y);
			que.push(p);
		}
		amin(ret, cnt);
	}
	
	cout << ret << endl;
	
	return 0;
}