import java.util.PriorityQueue;
import java.util.Scanner;


public class Main {
	static int[] tatesum,yokosum;
	public static void main(String[] args){
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int siro = sc.nextInt();
		int[] siros = new int[siro];
		for(int i=0;i<siro;i++) siros[i]=sc.nextInt();
		int kuro = sc.nextInt();
		int[] kuros = new int[kuro];
		for(int i=0;i<kuro;i++) kuros[i]=sc.nextInt();
		int ans=0;
		//siro
		PriorityQueue<Integer> siroque = new PriorityQueue<>();
		PriorityQueue<Integer> kuroque = new PriorityQueue<>();
		for(int i=0;i<siro;i++) siroque.add(-siros[i]);
		for(int i=0;i<kuro;i++) kuroque.add(-kuros[i]);
		int now=-siroque.poll();
		int flag = 1;
		int count=1;
		while( (flag==1&&!kuroque.isEmpty()) || (flag==-1&&!siroque.isEmpty()) ) {
			if(flag==1){
				while(-kuroque.peek()>=now){
					kuroque.poll();
					if(kuroque.isEmpty()) break;
				}
				if(kuroque.isEmpty()) break;
				now=-kuroque.poll();
				count++;
				flag*=-1;
			}else{
				while(-siroque.peek()>=now){
					siroque.poll();
					if(siroque.isEmpty()) break;
				}
				if(siroque.isEmpty()) break;
				now=-siroque.poll();
				count++;
				flag*=-1;
			}
		}
		ans=count;
		//kuro
		siroque = new PriorityQueue<>();
		kuroque = new PriorityQueue<>();
		for(int i=0;i<siro;i++) siroque.add(-siros[i]);
		for(int i=0;i<kuro;i++) kuroque.add(-kuros[i]);
		now=-kuroque.poll();
		flag = -1;
		count=1;
		while( (flag==1&&!kuroque.isEmpty()) || (flag==-1&&!siroque.isEmpty()) ) {
			if(flag==1){
				while(-kuroque.peek()>=now){
					kuroque.poll();
					if(kuroque.isEmpty()) break;
				}
				if(kuroque.isEmpty()) break;
				now=-kuroque.poll();
				count++;
				flag*=-1;
			}else{
				while(-siroque.peek()>=now){
					siroque.poll();
					if(siroque.isEmpty()) break;
				}
				if(siroque.isEmpty()) break;
				now=-siroque.poll();
				count++;
				flag*=-1;
			}
		}
		ans=Math.max(ans,count);
		System.out.println(ans);
	}
}