#include <bits/stdc++.h>
using namespace std;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FORR(x,arr) for(auto&& x:arr)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
typedef long long ll;
// -------------------------------------

int NW, NB;
int W[10], B[10];

void Main() {
  cin >> NW;
  REP(i, NW) cin >> W[i];
  cin >> NB;
  REP(i, NB) cin >> B[i];

  sort(W, W+NW);
  sort(B, B+NB);

  int x = W[0];
  int aw = 1;
  REP(i, 20) {
    int *b, *e;
    if (i%2) {
      // w
      b = W;
      e = W+NW;
    }
    else {
      // b
      b = B;
      e = B+NB;
    }
    auto p = lower_bound(b, e, x+1);
    if (p == e) break;
    x = *p;
    aw++;
  }

  x = B[0];
  int ab = 1;
  REP(i, 20) {
    int *b, *e;
    if (i%2) {
      // b
      b = B;
      e = B+NB;
    }
    else {
      // w
      b = W;
      e = W+NW;
    }
    auto p = lower_bound(b, e, x+1);
    if (p == e) break;
    x = *p;
    ab++;
  }

  cout << max(aw, ab) << endl;

}
int main() {Main(); return 0; }