#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <complex>

using namespace std;

#define INF (INT_MAX/3)
#define PI (2*acos(0.0))
#define EPS (1e-8)

typedef long long ll;
typedef unsigned long long ull;

#define BLACK 0
#define WHITE 1
int Nw, Nb, w, b, res = 0;
vector<int> W, B;

int main(){
  ios_base::sync_with_stdio(0);
  
  cin >> Nw;
  for(int i = 0; i < Nw; i++) { cin >> w; W.push_back(w); }
  cin >> Nb;
  for(int i = 0; i < Nb; i++) { cin >> b; B.push_back(b); }
  sort(W.begin(), W.end(), greater<int>());
  sort(B.begin(), B.end(), greater<int>());

  for(int i = 0; i < 2; i++){
    int a = 0, b = 0, tmp = 0, k = 1000;
    while(true){
      while(a < W.size() && W[a] >= k) a++;
      if(a >= W.size()) break;
      k = W[a]; tmp++; a++;

      while(b < B.size() && B[b] >= k) b++;
      if(b >= B.size()) break;
      k = B[b]; tmp++; b++;
    }
    res = max(res, tmp);
    swap(W, B);
  }
  cout << res << endl;
  return 0;
}