#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
typedef long long ll;

#define MAX 1501
int N;
int A[MAX];
int L[MAX];

int ans(int start)
{
    priority_queue<pii, vector<pii>, greater<pii>> q;
    rep(i, N)
    {
        q.push(mp(A[i], 0));
    }
    int end = start;
    while (true) {
        pii pc = q.top();
        q.pop();
        q.push(mp(pc.first + L[start], pc.second + 1));
        start++;
        if (start == N) {
            start = 0;
        }
        if (end == start) {
            break;
        }
    }
    int maxc = 0;
    while (not q.empty()) {
        const pii p = q.top();
        q.pop();
        chmax(maxc, p.snd);
    }
    return maxc;
}

int main()
{

    cin >> N;
    rep(i, N)
    {
        cin >> A[i];
    }
    rep(i, N)
    {
        int b;
        cin >> b;
        L[i] = b / 2;
    }
    int minc = N + 1;
    rep(i, N)
    {
        chmin(minc, ans(i));
    }
    cout << minc << endl;
    return 0;
}