#include <bits/stdc++.h>
using namespace std;
const int INF = 100000;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  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++){
      pq.push(make_pair(A[j], 0));
    }
    for (int j = 0; j < N; j++){
      int l = pq.top().first;
      int t = pq.top().second;
      pq.pop();
      pq.push(make_pair(l + B[(i + j) % N] / 2, t + 1));
    }
    int mx = 0;
    for (int j = 0; j < N; j++){
      mx = max(mx, pq.top().second);
      pq.pop();
    }
    ans = min(ans, mx);
  }
  cout << ans << endl;
}