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

int n;
vector<int>a,b;
int i,j,k;
int ans;

void scan();
void solve();
int cnt(int index);
void write();

struct monstar
{
	int battle;
	int level;
};

int main(void) {
	scan();
	solve();
	write();
	return 0;
}

void scan() {
	cin >> n;
	a=vector<int>(n);
	b=vector<int>(n);
	for (k = 0; k < n; k++) {
		cin >> a[i];
	}
	for (k = 0; k < n; k++) {
		cin >> b[i];
	}
}

void solve() {
    ans=n;
	for (j = 0; j < n; j++) {
		int a = cnt(j);
		if (a < ans) {
			ans = a;
		}
	}
}

void write() {
	cout << ans << endl;
}

int cnt(int index) {
    int max=0;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
	for (i = 0; i < n; i++){
	    pair<int,int>pa;
	    pa.first=a[i];
	    pa.second=0;
		pq.push(pa);
	}
    for(i=0;i<n;i++){
        pair<int,int> m=pq.top();
        pq.pop();
        m.first+=b[(i+index)%n]/2;
        m.second++;
        if(max<m.second){
            max=m.second;
        }
        pq.push(m);
    }

	return max;
}