import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main( String[] args ) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] A=new int[n];
int[] B=new int[n];
int[] C=new int[n];
for (int i = 0; i < n; i) A[i]=scanner.nextInt();
for (int i = 0; i < n; i) B[i]=scanner.nextInt();
for (int i = 0; i < n; i++) C[i]=scanner.nextInt();
int max_a=work(A,B,C,n);
int max_b=work(B,A,C,n);
int max_c=work(C,B,A,n);
int max=Math.max(max_a,Math.max(max_b,max_c));
System.out.println(max);
}
private static int work( int[] a, int[] b, int[] c ,int n) {
Integer[] w = new Integer[n];
for (int i = 0; i < n; i++) w[i]=a[i]-b[i]-c[i];
Arrays.sort(w, new Comparator<Integer>() {
public int compare( Integer o1, Integer o2 ) {
return o2.compareTo(o1);
}
});
int res=-1;
long sum=0;
for (int i = 0; i < n; i++) {
sum+=w[i];
if(sum>0) res=i+1;
else break;
}
return res;
}
}