#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

const int INF = 1 << 29;

struct State {
  int level;
  int battle;
  State(int l, int b): level(l), battle(b) {}

  bool operator < (const State & stt) const {
    return stt.level == level ? stt.battle < battle : stt.level < level;
  }
};

int main() {
  // ios_base::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> A(N), B(2 * N);
  rep(i, N) cin >> A[i];
  rep(i, N) {
    cin >> B[i];
    B[i + N] = B[i];
  }

  int ans = INF;
  rep(i, N) {
    priority_queue<State> pq;
    rep(j, N) pq.push(State(A[j], 0));
    int maxBattle = 0;
    rep(j, N) {
      State stt = pq.top();
      pq.pop();
      stt.level += B[i + j] / 2;
      maxBattle = max(maxBattle, ++stt.battle);
      pq.push(stt);
    }
    ans = min(ans, maxBattle);
  }

  cout << ans << endl;

  return 0;
}