#include <bits/stdc++.h>

template<typename T> T in() { abort(); return T(); }
template<> std::string in() { std::string str; std::cin >> str; return str; }
template<> int in() { int x; scanf("%d", &x); return x; }

template<typename T> void out(T x) { abort(); }
template<> void out(const char* x) { printf("%s\n", x); }
template<> void out(std::string x) { std::cout << x << std::endl; }
template<> void out(int x) { printf("%d\n", x); }
template<> void out(long x) { printf("%ld\n", x); }

struct Monster {
  Monster() {}
  Monster(int level_, int times_) : level(level_), times(times_) {}
  int level;
  int times;  
};

bool operator < (const Monster& a, const Monster& b) {
  if( a.level != b.level ) {
    return a.level > b.level;
  }
  return a.times > b.times;
}

inline Monster battle(Monster monster, int lv) {
  return Monster(monster.level + lv / 2, monster.times + 1);
}

int n;
int xs[2048];
int ys[2048];

int main() {
  n = in<int>();
  for(int i = 0; i < n; ++i) xs[i] = in<int>();
  for(int i = 0; i < n; ++i) ys[i] = in<int>();

  int res = 0;
  for(int i = 0; i < n; ++i) {
    std::priority_queue<Monster> q;
    for(int j = 0; j < n; ++j) {
      q.push(Monster(xs[j], 0));
    }
    for(int j = 0; j < n; ++j) {
      int k = (i + j) % n;
      Monster monster = q.top(); q.pop();
      q.push(battle(monster, ys[k]));
    }
    while( not q.empty() ) {
      Monster monster = q.top(); q.pop();
      res = std::max(res, monster.times);
    }
  }

  out(res);
  
  return 0;
}