#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>

using namespace std;

int main() {
  int n;
  cin >> n;
  priority_queue <pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > a;
  int b[n];
  for (int i = 0; i < n; i++) {
    int t; cin >> t; a.push(make_pair(t, 0));
  }
  for (int i = 0; i < n; i++) cin >> b[i];

  int ans = 1e9;
  for (int i = 0; i < n; i++) {
    int t = 0;
    priority_queue <pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > ta = a;
    for (int j = 0; j < n; j++) {
      pair <int, int> p = ta.top(); ta.pop();
      p.first += b[(i+j)%n]/2;
      p.second++;
      t = max(t, p.second);
      ta.push(p);
    }
    ans = min(ans, t);
  }
  cout << ans << endl;
}