import java.io.*;
import java.util.*;
import java.math.*;

class Main {
	
	public static void out (Object o) {
		System.out.println(o);
	}
	
	public static int solve (int[] levelM , int[] levelE) {
		int ret = Integer.MAX_VALUE;
		int len = levelM.length;
		Arrays.sort(levelM);
		for (int i = 0; i < len; i++) {
			int win = 0;
			for (int j = i; win++ < len; j++) {
				j %= len;
				int upIndex = 0;
				int min = levelM[0] & 0xfff;
				for (int k = 1; k < len && levelM[0] >> 12 == levelM[k] >> 12; k++) {
					int f = levelM[k] & 0xfff;
					if (f < min) {
						min = f;
						upIndex = k;
					}
				}
				levelM[upIndex]++;
				levelM[upIndex] += (levelE[j] >> 1) << 12;
				Arrays.sort(levelM);
			}
			int max = 0;
			for (int k = 0; k < len; k++)
				max = Math.max(max , levelM[k] & 0xfff);
			ret = Math.min(ret , max);
		}
		return ret;
	}
	
	public static void main (String[] args) throws IOException {
		BufferedReader br = 
			new BufferedReader(new InputStreamReader(System.in));
		
		int len = Integer.parseInt(br.readLine());
		String[] line1 = br.readLine().split(" ");
		int[] levelM = new int[len];
		String[] line2 = br.readLine().split(" ");
		int[] levelE = new int[len];
		
		for (int i = 0; i < len; i++) {
			levelM[i] = Integer.parseInt(line1[i]) << 12;
			levelE[i] = Integer.parseInt(line2[i]);
		}
		
		out(solve(levelM , levelE));
	}
}