#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
using namespace std;


#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;
typedef long double lb;
/* ここからが本編 */

int main(void)
{
   int i,j,k;
   int nw,nb;
   int w[10];
   int b[10];
/* 入力開始! */
   cin >> nw;
   for(i=0;i<nw;i++) cin >> w[i];
   cin >> nb;
   for(i=0;i<nb;i++) cin >> b[i];
/* 入力終了！ */
   sort(w,w+nw);
   sort(b,b+nb);
   int cnt = 1;
   int ans = 0;
   int now_width = w[nw-1];
   int w_cnt = nw-2 ,b_cnt = nb-1;
   char go = 1;
   while(go) {
      for(;;b_cnt--) {
         if(b_cnt < 0) {
            go = 0; break;
         }
         if(now_width > b[ b_cnt ]) {
            now_width = b[ b_cnt ]; break;
         }
      }
      if(go == 0) break;
      cnt++;
      b_cnt--;
      for(;;w_cnt--) {
         if(w_cnt < 0) {
            go = 0; break;
         }
         if( now_width > w[ w_cnt ] ) {
             now_width = w[ w_cnt ]; break;
         }
      }
      if(go == 0) break;
      cnt++;
      w_cnt--;
   }
   ans = cnt;
   go = 1;
   now_width = b[nb-1];
   cnt = 1;
   w_cnt = nw-1 ,b_cnt = nb-2;
   while(1) {
      for(;;w_cnt--) {
         if(w_cnt < 0) {
            go = 0; break;
         }
         if( now_width > w[ w_cnt ] ) {
             now_width = w[ w_cnt ]; break;
         }
      }
      if(go == 0) break;
      cnt++;
      w_cnt--;
      for(;;b_cnt--) {
         if(b_cnt < 0) {
            go = 0; break;
         }
         if(now_width > b[ b_cnt ]) {
            now_width = b[ b_cnt ]; break;
         }
      }
      if(go == 0) break;
      cnt++;
      b_cnt--;
   }
   if(ans < cnt) ans = cnt;
   cout << ans << endl;
   return 0;
}