#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
int A[1500];
int B[1500];

vector< pair<int,int> > poke(1500);

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(10);//

	int N;
	cin>>N;
	rep(i,N)cin>>A[i];
	rep(i,N){
		cin>>B[i];
		B[i] /= 2;
	};
	int ans = N;
	int tMaxCount=0;
	//
	for(int i=0;i<N;++i){
		tMaxCount=0;
		for(int m=0;m<N;++m){
			poke[m].first  = A[m];
			poke[m].second = 0;
		}
		sort(poke.begin(),poke.begin()+N);
		for(int k=0;k<N;++k){
			poke[0].first  += B[(i+k)%N];
			poke[0].second += 1;
			if( poke[0].second > tMaxCount ){
				tMaxCount = poke[0].second;
				if( ans <= tMaxCount ){
					break;
				}
			}

			for(int so=0;so<N-1;++so){
				if(poke[so] > poke[so+1] ){//pair比較
					swap( poke[so],poke[so+1] );
				}else{
					break;
				}
			}
		}
		
		if(ans > tMaxCount){
			ans = tMaxCount;
		}
	}
	P(ans);
    return 0;
}