import java.util.*;

public class Main {
	
	
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int friend[]=new int[n];
		int enemy[]=new int[n];
		for(int i=0;i<n;i++){
			friend[i]=sc.nextInt();
		}
		for(int i=0;i<n;i++){
			enemy[i]=sc.nextInt();
		}
		int ans=Integer.MAX_VALUE;
		for(int i=0;i<n;i++){
			PriorityQueue<conect>Q=new PriorityQueue<>();
			int times[]=new int[n];
			for(int j=0;j<n;j++){
				Q.add(new conect(friend[j],0,j));
			}
			for(int j=0;j<n;j++){
				int Enum=j+i;
				if(j+i>=n)Enum-=n;
				conect x=Q.poll();
				int y=x.l+enemy[Enum]/2;
				times[x.n]++;
				Q.add(new conect(y,times[x.n],x.n));
			}
			int ansk=0;
			for(int j=0;j<n;j++){
				ansk=Math.max(times[j],ansk);
			}
			ans=Math.min(ansk,ans);
		}
		System.out.println(ans);
	}}

class conect implements Comparable<conect> {
	int l;
	int t;
	int n;

	public conect(int l, int t, int n) {
		this.l = l;
		this.t = t;
		this.n = n;
	}

	public conect() {
	}

	@Override
	public int compareTo(conect o) {
		if(this.l!=o.l)	return this.l - o.l;
		return this.t-o.t;
	}

}