#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

struct Monster {
  ll level;
  int cnt;

  Monster(ll level = -1, int cnt = -1) {
    this->level = level;
    this->cnt = cnt;
  }

  bool operator>(const Monster &n) const {
    return 1000000 * level + cnt > 1000000 * n.level + n.cnt;
  }
};

int main() {
  int N;
  cin >> N;
  int A[N];
  int B[N];

  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  for (int i = 0; i < N; ++i) {
    cin >> B[i];
  }

  int min_battle_cnt = INT_MAX;
  for (int i = 0; i < N; ++i) {
    priority_queue <Monster, vector<Monster>, greater<Monster>> pque;

    for (int j = 0; j < N; ++j) {
      pque.push(Monster(A[j], 0));
    }

    for (int j = 0; j < N; ++j) {
      int id = (j + i) % N;
      Monster m = pque.top();
      pque.pop();
      m.cnt++;
      m.level += B[id] / 2;
      pque.push(m);
    }

    int max_cnt = 0;

    while (not pque.empty()) {
      Monster m = pque.top();
      pque.pop();
      max_cnt = max(max_cnt, m.cnt);
    }

    min_battle_cnt = min(min_battle_cnt, max_cnt);
  }

  cout << min_battle_cnt << endl;

  return 0;
}