#include <cstdio>
#include <vector>
#include <queue>

#define mp std::make_pair

typedef std::pair<int,int> P;
typedef std::pair<P, int> State;

int main(){
    int N;
    scanf("%d", &N);

    int A[1500], B[1500];
    for(int i=0;i<N;i++){scanf("%d", A+i);}
    for(int i=0;i<N;i++){scanf("%d", B+i);}
    
    int res = 1500;
    for(int first=0;first<N;first++){
        int counter[1500];
        std::fill(counter, counter+1500, 0);

        std::priority_queue<State, std::vector<State>, std::greater<State>> q;
        for(int i=0;i<N;i++){q.push(mp(mp(A[i], 0), i));}

        for(int i=0;i<N;i++){
            State s = q.top(); q.pop();
            int index = (first+i) % N;
            
            q.push(mp(mp(s.first.first+B[index]/2, s.first.second+1), s.second));
            counter[s.second] += 1;
        }

        int mx = 0;
        for(int i=0;i<N;i++){
            mx = std::max(mx, counter[i]);
        }

        res = std::min(res, mx);
    }

    printf("%d\n", res);
}