#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define all(x) (x).begin(), (x).end()



#define INF 999
enum kind{ WHITE, BLACK };

int Nw, Nb;
vector<int> W, B;

// top_k (WHITE or BLACK) から積んでいったときの最大の高さ
int max_height(kind top_k)
{
	int h = 0;					// 高さ
	int wpos = 0, bpos = 0;		// ポインタ
	int len = INF;				// 一番上のブロックの長さ

	while (wpos != W.size() && bpos != B.size()) {
		// 積む
		len = (top_k == WHITE ? W[wpos] : B[bpos]);
		h++;

		// 反転
		top_k = (top_k == WHITE ? BLACK : WHITE);

		// ポインタを移動
		if (top_k == WHITE)
			while (wpos < W.size() && W[wpos] >= len) wpos++;
		else
			while (bpos < B.size() && B[bpos] >= len) bpos++;
	}

	return h;
}

int yuki0110()
{
	cin >> Nw;
	W.resize(Nw);
	for (int i = 0; i < Nw; i++) cin >> W[i];
	sort(all(W), greater<int>());

	cin >> Nb;
	B.resize(Nb);
	for (int i = 0; i < Nb; i++) cin >> B[i];
	sort(all(B), greater<int>());

	cout << max(max_height(WHITE), max_height(BLACK)) << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0110();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}