#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MOD 1000000007
#define INF 1000000000

int main(){
  int N;
  cin>>N;
  vector<int> A(N),B(N);
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  for(int i=0;i<N;i++){
    cin>>B[i];
  }
  int ans=INF;
  for(int i=0;i<N;i++){
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    for(int j=0;j<N;j++){
      pair<int,int> p=make_pair(A[j],0);
      pq.push(p);
    }
    for(int j=0;j<N;j++){
      pair<int,int> p=pq.top();
      pq.pop();
      int k=(i+j)%N;
      p.first+=B[k]/2;
      p.second+=1;
      pq.push(p);
    }
    int count=0;
    while(!pq.empty()){
      pair<int,int> p=pq.top();
      pq.pop();
      count=max(count,p.second);
    }
    ans=min(count,ans);
  }
  cout<<ans<<endl;
}