#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int run(vector<int> &a, vector<int> &b) {
  int prev = 10000;
  bool ok = true;
  int i = 0, j = 0;
  int p = 0;
  int res = 0;
  while (ok) {
    if (p & 1) {

      for (int k = j; k < sz(b); k++) {
        if (b[k] < prev) {
          res++;
          prev = b[k];
          j = k;
          break;
        }
        if (k == sz(b) - 1) ok = false;
      }
    } else {
      for (int k = i; k < sz(a); k++) {
        if (a[k] < prev) {
          res++;
          prev = a[k];
          i = k;
          break;
        }
        if (k == sz(a) - 1) ok = false;
      }
    }
    p++;
  }
  return res;
}

int main(){
  int n;
  cin >> n;
  vector<int> w(n);
  rep(i,n) cin >> w[i];
  int m;
  cin >> m;
  vector<int> b(m);
  rep(i,m) cin >> b[i];
  sort(w.begin(), w.end(), greater<int>());
  sort(b.begin(), b.end(), greater<int>());
  int res1 = run(w,b);
  int res2 = run(b,w);
  cout << max(res1,res2) << endl;
  return 0;
}