#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];
	int ans = N;
	//O(N^3)
	for(int i=0;i<N;++i){
		int mae=0;
		//for(int mae=0;mae<N;++mae)
		{//（最初に戦えるモンスターは自由に選べる）×
			for(int m=0;m<N;++m){
				poke[m].first  = A[m];
				poke[m].second = 0;
			}

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