#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int n;
int a[1500], b[1500];
priority_queue<P, vector<P>, greater<P>> ori;
int main(){
	cin >> n;
	rep(i, n) {
		cin >> a[i]; ori.push({ a[i],0 });
	}
	rep(i, n)cin >> b[i];
	int out = 5000;
	rep(s, n) {
		priority_queue<P, vector<P>, greater<P>> q = ori;
		rep(i, n) {
			P nex = q.top(); q.pop();
			int id = (i + s) % n;
			nex.first += b[id] / 2; nex.second++;
			q.push(nex);
		}
		int ma = 0;
		while (!q.empty()) {
			ma = max(ma, q.top().second); q.pop();
		}
		out = min(out, ma);
	}
	cout << out << endl;
	return 0;
}