#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <climits>

using namespace std;

int main() {
  int nw;
  cin >> nw;
  vector <pair<int, int> > a;
  for (int i = 0; i < nw; i++) {
    int x;
    cin >> x;
    a.push_back(make_pair(x, 1));
  }
  int nb;
  cin >> nb;
  for (int i = 0; i < nb; i++) {
    int x;
    cin >> x;
    a.push_back(make_pair(x, 0));
  }
  sort(a.begin(), a.end());
  int ans = 0;
  bool b = true;
  int cnt = 0, pre = INT_MAX;
  for (int i = a.size()-1; i >= 0; i--) {
    if (a[i].second != b || a[i].first >= pre) continue;
    b = !b;
    pre = a[i].first;
    cnt++;
  }
  ans = max(ans, cnt);
  b = false;
  cnt = 0; pre = INT_MAX;
  for (int i = a.size()-1; i >= 0; i--) {
    if (a[i].second != b || a[i].first >= pre) continue;
    b = !b;
    pre = a[i].first;
    cnt++;
  }
  ans = max(ans, cnt);
  cout << ans << endl;
}