import java.util.*;
 
class status implements Comparable<status>{
	int level;
	int count;
	status(int level,int count){
		this.level=level;
		this.count = count;
	}
	@Override
	public int compareTo(status arg0) {
		int value = this.level - arg0.level;
		if(value==0){
			return this.count-arg0.count;
		}
		return value;
	}
	
}
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] party = new int[N];
		int[] enemy = new int[N];
		for(int i=0;i<N;i++){
			party[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++){
			Queue<status> queue= new PriorityQueue<status>();
			for(int j=0;j<N;j++){
				queue.add(new status(party[j],0));
			}
			for(int j=0;j<N;j++){
				status temp = queue.poll();
				temp.level+=enemy[(i+j)%N]/2;
				temp.count++;
				queue.add(temp);
			}
			int max=0;
			for(status a:queue){
				max=Math.max(max, a.count);
			}
			ans=Math.min(ans,max);
		}
		System.out.println(ans);
	}
}