// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

struct mos{
  int p, g = 0;
  mos(int p): p(p){}
  mos(){}
  bool operator<(const mos &right) const{
    if(p != right.p)return p > right.p;
    return g > right.g;
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n)cin >> a[i];
  rep(i, n)cin >> b[i];
  vector<mos> vec(n);
  priority_queue<mos> pq;
  int res = inf;
  for(int i = 0; i < n; i++){
    rep(i, n)pq.push(mos(a[i]));
    for(int j = 0; j < n; j++){
      int B = b[(i + j) % n];
      auto p = pq.top(); pq.pop();
      p.p += B / 2;
      p.g++;
      pq.push(p);
    }
    int tmp = 0;
    while(!pq.empty()){
      auto p = pq.top();
      pq.pop();
      tmp = max(tmp, p.g);
    }
    res = min(res, tmp);
  }
  cout << res << endl;
	return 0;
}