#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<LL>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<LL,LL>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EP emplace_back
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

int N;
VI A,B;
int f(priority_queue<PII,vector<PII>,greater<PII>> q,int st){
    auto qbuf=q;
    FOR(i,st,N+st){
        PII el=qbuf.top();
        qbuf.pop();
        el.first+=B[i%N]/2;
        el.second++;
        qbuf.push(el);
    }
    int res=0;
    while(!qbuf.empty()){
        auto el=qbuf.top();
        qbuf.pop();
        res=max(res,el.second);
    }
    return res;
}

int main (void){
    cin>>N;
    A=VI(N);
    B=VI(N);
    vector<PII> m(N);
    priority_queue<PII,vector<PII>,greater<PII>> q;
    REP(i,N){
        cin>>A[i];
        m[i].first=A[i];
        m[i].second=0;
        q.push(m[i]);
    }
    REP(i,N) cin>>B[i];
    int ans=INF;
    REP(i,N){
        ans=min(ans,f(q,i));
    }
    cout<<ans<<endl;
}