import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] kenArr = new int[n + 1];
		for (int i = 0; i <= n; i++) {
		    kenArr[i] = sc.nextInt();
		}
		int[] kooArr = new int[n + 1];
		for (int i = 0; i <= n; i++) {
		    kooArr[i] = sc.nextInt();
		}
		int[] strategy = new int[n];
		int kenIdx = 0;
		int kooIdx = 0;
		for (int i = 0; i < n; i++) {
		    if (kenArr[kenIdx + 1] + kooArr[kooIdx] >= kenArr[kenIdx] + kooArr[kooIdx + 1]) {
		        strategy[i] = kenArr[kenIdx + 1] + kooArr[kooIdx];
		        kenIdx++;
		    } else {
		        strategy[i] = kenArr[kenIdx] + kooArr[kooIdx + 1];
		        kooIdx++;
		    }
		}
		int[] questions = new int[n];
		for (int i = 0; i < n; i++) {
		    questions[i] = sc.nextInt();
		}
		Arrays.sort(questions);
		if (questions[0] > strategy[0]) {
		    System.out.println(0);
		    return;
		}
		int left = 0;
		int right = n + 1;
		while (right - left > 1) {
		    int m = (left + right) / 2;
		    boolean can = true;
		    for (int i = 0; i < m; i++) {
		        if (questions[m - i - 1] > strategy[i]) {
		            can = false;
		            break;
		        }
		    }
		    if (can) {
		        left = m;
		    } else {
		        right = m;
		    }
		}
		System.out.println(left);
	}
}