#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
int w[20],b[20];
int n,m;
int dp1[30],dp2[30];
int main(){
  cin >> n;
  for(int i=0;i<n;++i) cin >> w[i];
  cin >> m;
  for(int i=0;i<m;++i) cin >> b[i];
  sort(w,w+n);
  sort(b,b+m);
  

  /*
  for(int i=0;i<n;++i) cout << w[i] << " ";
  cout << endl;
  for(int i=0;i<m;++i) cout << b[i] << " ";
  cout << endl;
  */

  for(int i=0;i<n;++i) dp1[i] = 1;
  for(int j=0;j<m;++j) dp2[j] = 1;

  while(true){
    bool changed = false;
    for(int i=0;i<n;++i){
      for(int j=0;j<m;++j){
	if(b[j]>w[i] && dp2[j] < dp1[i]+1){
	  changed = true;
	  dp2[j] = dp1[i]+1;
	}
      }
    }
    for(int i=0;i<m;++i){
      for(int j=0;j<n;++j){
	if(w[j]>b[i] && dp1[j] < dp2[i]+1){
	  changed = true;
	  dp1[j] = dp2[i]+1;
	}
      }
    }
    if(!changed) break;
  }
  
  /*
  for(int i=0;i<n;++i) cout << dp1[i] << " ";
  cout << endl;
  for(int j=0;j<m;++j) cout << dp2[j] << " ";
  cout << endl;
  */
  cout << max(dp1[n-1],dp2[m-1]) << endl;
  return 0;
}