#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define CLR(a) memset((a), 0 ,sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	struct state{
		int level, time;
		state(int l, int t): level(l), time(t){}
		bool operator > (const state &e) const{
			if(level == e.level) return time > e.time? true : false;
			else if(level > e.level) return true;
			else return false;
		}
	};

	priority_queue<state, vector<state>, greater<state> > que;
	VI B(N);

	REP(i, N) {
		int A;
		cin >> A;
		que.push(state(A, 0));
	}
	REP(i, N){
		cin >> B[i];
		B[i] /= 2;
	}

	int ret = N;
	REP(i, N){
		priority_queue<state, vector<state>, greater<state> > q = que;

		function<void(int)> cmp = [&](int n){
			state tmp = q.top();
			q.pop();
			tmp.level += B[n];
			tmp.time++;
			q.push(tmp);
			//cout << tmp.level << " " << tmp.time << endl;
		};

		REP(j, N - i){
			cmp(j + i);
		}
		REP(j, i){
			cmp(j);
		}
		int m = 0;
		while(!q.empty()){
			m = max(m, q.top().time);
			q.pop();
		}
		ret = min(ret, m);
	}

	cout << ret << endl;

	return 0;
}