#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define LONG_INF 100000000000000
int main() {
	int a, b;
	cin >> a;
	vector<int> w,e;
	REP(i, a) {
		int tmp;
		cin >> tmp;
		w.push_back(tmp);
	}
	cin >> b;
	REP(i, b) {
		int tmp;
		cin >> tmp;
		e.push_back(tmp);
	}
	sort(w.begin(), w.end(),greater<int>());
	sort(e.begin(), e.end(),greater<int>());
	int left = 0, right = 0;
	int ans = 0;
		right++;
		for (int i = 1;i >= 0;++i) {
			if (i % 2 == 1) {
				while (left != a) {
					if (w[left] < e[right - 1]) {
						left++;
						goto ok2;
					}
					left++;
				}
				ans = i;
				goto failed;
			}
			else {
				while (right != b) {
					if (w[left - 1] > e[right]) {
						right++;
						goto ok2;
					}
					right++;
				}
				ans = i;
				goto failed;
			}
		 ok2:;
		}
	failed:;
		left = 0;right = 0;
		left++;
		for (int i = 0;i >= 0;++i) {
			if (i % 2 == 1) {
				while (left != a) {
					if (w[left] < e[right - 1]) {
						left++;
						goto ok;
					}
					left++;
				}
				cout << max(ans,i+1) << endl;
				return 0;
			}
			else {
				while (right != b) {
					if (w[left - 1] > e[right]) {
						right++;
						goto ok;
					}
					right++;
				}
				cout << max(ans,i+1) << endl;
				return 0;
			}
		ok:;
		}
	}