#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

typedef priority_queue<pii, vector<pii>, greater<pii> > pq;
pq qf, q;
int m[1500];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  FOR(i, 0, n){
    int a;
    cin >> a;
    qf.push(pii(a, 0));
  }
  FOR(i, 0, n){
    int a;
    cin >> a;
    m[i] = a/2;
  }
  int ans = inf;
  FOR(i, 0, n){
    q = qf;
    FOR(j, 0, n){
      pii tmp = q.top();
      q.pop();
      tmp.first += m[(i + j) % n];
      tmp.second++;
      q.push(tmp);
    }
    int m = -1;
    while(!q.empty()){
      pii tmp = q.top();
      m = max(m, tmp.second);
      q.pop();
    }
    ans = min(ans, m);
  }
  cout << ans << endl;
}