#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for(int i=0; i<n; ++i)
        cin >> a[i];
    for(int i=0; i<n; ++i)
        cin >> b[i];

    int ret = INT_MAX;
    for(int i=0; i<n; ++i){
        multiset<pair<int, int> > ms;
        for(int j=0; j<n; ++j)
            ms.insert(make_pair(a[j], 0));

        for(int j=0; j<n; ++j){
            int x = b[(i+j)%n] / 2;
            pair<int, int> p = *ms.begin();
            ms.erase(ms.begin());
            p.first += x;
            ++ p.second;
            ms.insert(p);
        }

        int cnt = 0;
        for(multiset<pair<int, int> >::iterator it=ms.begin(); it!=ms.end(); ++it)
            cnt = max(cnt, it->second);
        ret = min(ret, cnt);
    }
    cout << ret << endl;

    return 0;
}