#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
using ll = long long;
using namespace std;

const ll MOD = 1e9 + 7;

int A[1510], B[1510];

bool operator<(const pair<int, int> &a, const pair<int, int> &b)
{
    if (a.first == b.first)
        return a.second < b.second;
    return a.first < b.first;
};
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
int main(void)
{
    int N;
    cin >> N;

    for (int i = 0; i < N; ++i)
    {
        cin >> A[i];
        pq.push(make_pair(A[i], 0));
    }
    for (int i = 0; i < N; ++i)
        cin >> B[i];

    int ans = 100000;

    for (int i = 0; i < N; ++i)
    {
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq2 = pq;
        int idx = 0;

        while (idx != N)
        {
            pair<int, int> p = pq2.top();
            pq2.pop();
            p.first += B[(i + idx) % N] / 2;
            p.second += 1;
            pq2.push(p);
            idx++;
        }

        int maxV = 0;
        while (pq2.size())
        {
            pair<int, int> p = pq2.top();
            pq2.pop();
            maxV = max(maxV, p.second);
        }
        ans = min(ans, maxV);
    }
    cout << ans << endl;
    return 0;
}