#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
  int n,a,b;
  cin>>n;
  vector<pair<int,int>> vp;
  for(int i=0; i<n; ++i){
    cin>>a;
    pair<int,int> p=make_pair(a,0);
    vp.push_back(p);
  }
  vector<int> ve;
  for(int i=0; i<n; ++i){
    cin>>b;
    ve.push_back(b);
  }
  int x=1501;
  for(int i=0; i<n; ++i){
    rotate(ve.begin(),ve.begin()+1,ve.end());
    vector<pair<int,int>> vp2=vp;
    for(int j=0; j<n; ++j){
      sort(vp2.begin(),vp2.end());
      int c=ve[j]/2;
      vp2[0].first+=c;
      vp2[0].second+=1;
    }
    int y=0;
    for(int j=0; j<n; ++j){
      int d=vp2[j].second;
      if(d>y) y=d;
    }
    if(y<x) x=y;
  }
  cout<<x<<endl;
  return 0;
}