#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  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 res = N;
  for (int s = 0; s < N; s++) {
    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        que;
    for (int i = 0; i < N; i++) {
      que.push(make_pair(A[i], 0));
    }
    int cnt = 0;
    for (int i = 0; i < N; i++) {
      auto q = que.top();
      que.pop();
      int a = q.first, c = q.second;
      a += B[(s + i) % N] / 2;
      que.push(make_pair(a, c + 1));
      cnt = max(cnt, c + 1);
    }
    res = min(res, cnt);
  }
  cout << res << '\n';
  return 0;
}