#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;

// 方針
// 大きい方から白黒か黒白

int main(){
  int nw;
  cin >> nw;
  int w[nw];
  for (int i = 0; i < nw; i++) cin >> w[i];
  sort(w, w + nw);
  reverse(w, w + nw);

  int nb;
  cin >> nb;
  int b[nb];
  for (int i = 0; i < nb; i++) cin >> b[i];
  sort(b, b + nb);
  reverse(b, b + nb);

  int ans = 1;
  // 黒白
  int wi = 0, bi = 1, h = b[0];
  while(1){
    while(h <= w[wi] && wi < nw) wi++;
    if(wi == nw) break;
    h = w[wi];
    ans++;
    wi++;
    while(h <= b[bi] && bi < nb) bi++;
    if(bi == nb) break;
    h = b[bi];
    ans++;
    bi++;
  }
  int ret = ans;

  // 白黒
  ans = 1;
  wi = 1, bi = 0, h = w[0];
  while(1){
    while(h <= b[bi] && bi < nb) bi++;
    if(bi == nb) break;
    h = b[bi];
    ans++;
    bi++;
    while(h <= w[wi] && wi < nw) wi++;
    if(wi == nw) break;
    h = w[wi];
    ans++;
    wi++;
  }
  ret = max(ans, ret);
  cout << ret << endl;
  return 0;
}