#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  vector<pair<int, int> > vs;
  REP (i, 2) {
    int n;
    cin >> n;
    REP (j, n) {
      int w;
      cin >> w;
      vs.emplace_back(w, i);
    }
  }

  sort(vs.rbegin(), vs.rend());

  int ret = 0;
  REP (i, 2) {
    int tmp = 0;
    int base = 1000000;
    int cur = i;

    REP (j, vs.size()) {
      if (vs[j].first < base && vs[j].second != cur) {
        ++tmp;
        base = vs[j].first;
        cur = vs[j].second;
      }
    }
    ret = max(ret, tmp);
  }

  cout << ret << endl;
  
  return 0;
}