#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <algorithm>
#include <functional>
#include <limits.h>
#include <bitset>

#include <tuple>
#include <unordered_map>

#define mp       make_pair
#define mt       make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int N,M;
vector<int> W,B;

int main(){
  cin >> N;
  W.resize(N);
  for (int i = 0; i < N; i++){
    cin >> W[i];
  }
  cin >> M;
  B.resize(M);
  for (int i = 0; i < M; i++){
    cin >> B[i];
  }
  sort(W.rbegin(), W.rend());
  sort(B.rbegin(), B.rend());
  int res = 0;
  int cnt = 0;
  for (int cnt = 0; cnt < 2; cnt++){
    int width = 114514;
    stack<int> st;
    st.push(width);
    int b,w;
    b = w = 0;
    int color = cnt;
    while (true){//black
      if (color == 0){
	if (w < W.size()){
	  bool ok = false;
	  for (int i = w; i < W.size(); i++){
	    if (st.top() > W[i]){
	      w = i;
	      st.push(W[i]);
	      w++;
	      ok = true;
	      break;
	    }
	  }
	  if (!ok)break;
	}else{
	  break;
	}
      }else{
	if (b < B.size()){
	  bool ok = false;
	  for (int i = b; i < B.size(); i++){
	    if (st.top() > B[i]){
	      b = i;
	      st.push(B[i]);
	      b++;
	      ok = true;
	      break;
	    }
	  }
	  if (!ok)break;
	}else{
	  break;
	}
      }
      color = !color;
    }

    res = max(res, (int)st.size() - 1);
    while(!st.empty()){st.pop();}
  }
  cout << res << endl;
  return 0;
}