#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct monster {
  ll A, count;
  bool operator< (const monster &x) const { return A<x.A||(A==x.A&&count<x.count); };
  bool operator> (const monster &x) const { return A>x.A||(A==x.A&&count>x.count); };
};

int main() {
  int N; cin >> N;
  monster m[N]; rep(i,N) { cin >> m[i].A; m[i].count = 0; }
  ll B[N]; rep(i,N) cin >> B[i];
  ll result = LLINF;
  rep(i,N) {
    ll tres = 0;
    priority_queue<monster, vector<monster>, greater<monster>> pq; rep(i,N) pq.push(m[i]);
    rep(j,N) {
      monster now = pq.top(); pq.pop();
      now.A += B[(i+j)%N]/2; now.count++;
      pq.push(now);
    }
    while (pq.size()) { tres = max(tres,pq.top().count); pq.pop(); } 
    // cout << i << "->" << tres << endl;
    result = min(result, tres);
  }
  cout << result << endl;
  return 0;
}