#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=9000000009;


signed main(){
  int n;
  cin>>n;
  vector<int> w(n);
  REP(i,n)cin>>w[i];
  sort(ALL(w));
  int m;
  cin>>m;
  vector<int> b(m);
  REP(i,m)cin>>b[i];
  sort(ALL(b));
  int ans1=1,bot=w.back(),white=n-1,black=m-1;
  bool turn=true;//白が最下層
  REP(j,n+m){
    if(turn){
      for(int i=black;i>=0;i--){
        if(b[i]<bot){
          bot=b[i];ans1++;black=i;turn=false;break;
        }
      }
    }else{
      for(int i=white;i>=0;i--){
        if(w[i]<bot){
          bot=w[i];ans1++;white=i;turn=true;break;
        }
      }
    }
  }

  int ans2=1;
  bot=b.back(),white=n-1,black=m-1;
  turn=true;//黒が最下層
  REP(j,n+m){
    if(!turn){
      for(int i=black;i>=0;i--){
        if(b[i]<bot){
          bot=b[i];ans2++;black=i;turn=false;break;
        }
      }
    }else{
      for(int i=white;i>=0;i--){
        if(w[i]<bot){
          bot=w[i];ans2++;white=i;turn=true;break;
        }
      }
    }
  }
  cout<<max(ans1,ans2)<<endl;

  return 0;
}