#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  vector<int> b(n);
  rep(i, n) cin >> b[i];

  auto f = [&](int si) {
    priority_queue<P, vector<P>, greater<P>> q;
    rep(i, n) q.emplace(a[i], 0);

    int res = 0;
    rep(i, n) {
      auto [ai, cnt] = q.top();
      q.pop();
      int ni = (i + si) % n;
      //   db(i, ni);
      ai += b[ni] / 2;
      cnt++;
      //   db(ai, cnt);
      res = max(res, cnt);
      q.emplace(ai, cnt);
    }
    // db(si, res);
    return res;
  };

  int ans = n + 1;
  rep(i, n) ans = min(ans, f(i));
  cout << ans << endl;
  return 0;
}