#include <bits/stdc++.h>

int n, m;
int xss[2][16];

int next(int array[], int n, int begin, int x) {
  for(int i = begin; i < n; ++i) {
    if( x < array[i] ) return i; 
  }
  return n;
}

int solve() {
  int c = 0;
  int res = 0;
  int u[2] = {};
  int x = -1;
  for(;;) {
    int r = next(c == 0 ? xss[0] : xss[1], c == 0 ? n : m, u[c], x);
    if( r == (c == 0 ? n : m) ) return res;
    u[c] = r + 1;
    x = (c == 0 ? xss[0] : xss[1])[r];
    c = 1 - c;
    res += 1;
  }
  return res;
}

void rev() {
  std::swap(n, m);
  for(int i = 0; i < 16; ++i) {
    std::swap(xss[0][i], xss[1][i]);
  }
}

int main() {
  scanf("%d", &n);
  for(int i = 0; i < n; ++i) {
    scanf("%d", &xss[0][i]);
  }
  scanf("%d", &m);
  for(int i = 0; i < m; ++i) {
    scanf("%d", &xss[1][i]);
  }

  std::sort(xss[0], xss[0] + n);
  std::sort(xss[1], xss[1] + m);

  int t1 = solve();
  rev();
  int t2 = solve();
  printf("%d\n", std::max(t1, t2));

  return 0;
}