#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>

//#include<bits/stdc++.h>


using namespace std;



int main() {
	
	int a, b;
	vector<int>A, B;
	cin >> a;
	for (int i = 0; i < a; i++) {
		int x;
		cin >> x;
		A.push_back(x);
	}
	cin >> b;
	for (int i = 0; i < b; i++) {
		int x;
		cin >> x;
		B.push_back(x);
	}
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());
	int t = 0, m = 0;
	int a1 = 0, a2 = 0;
	int r = 0;
	while (1) {
		for (; t < a; t++) {
			if (A[t] > r) {
				r = A[t];
				a1++;
				break;
			}
		}
		for (; m < b; m++) {
			if (B[m] > r) {
				r = B[m];
				a1++;
				break;
			}
		}
		if (t == a-1 || m == b-1)break;
	}
	r = 0;
	t = 0, m = 0;
	while (1) {
		
		for (; m < b; m++) {
			if (B[m] > r) {
				r = B[m];
				a2++;
				break;
			}
		}

		for (; t < a; t++) {
			if (A[t] > r) {
				r = A[t];
				a2++;
				break;
			}
		}

		if (t == a-1 || m == b-1)break;
	}
	cout << max(a1, a2) << endl;

	return 0;

}