#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N,ans=1e18;cin>>N;vector<ll>A(N),B(2*N);REP(i,N)cin>>A[i];REP(i,N)cin>>B[i];
  REP(i,N){B[i]/=2;B[i+N]=B[i];}min_priority_queue<P>Q;
  REP(i,N){
    REP(j,N)Q.push(P(A[j],0));REP(j,N){P q=Q.top();Q.pop();q.F+=B[i+j];q.S++;Q.push(q);}
    ll res=0;while(Q.size()){res=max(res,Q.top().S);Q.pop();}ans=min(ans,res);
  }
  cout<<ans<<endl;
  return 0;
}