#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n[2];
int c[2][11];

int solve() {
    for (int i = 0; i < 2; i++) sort(c[i], c[i]+n[i]);
    int res = 1;
    for (int i = 0; i < 2; i++) {
        int k[2] = {n[0]-1, n[1]-1};
        int cnt = 1, idx = i;
        while (true) {
            while (k[1-idx] >= 0 && c[idx][k[idx]] <= c[1-idx][k[1-idx]]) k[1-idx]--;
            if (k[1-idx] < 0) break;
            cnt++;
            idx = 1 - idx;
        }
        res = max(res, cnt);
    }
    return res;
}

void input() {
    for (int t = 0; t < 2; t++) {
        cin >> n[t];
        for (int i = 0; i < n[t]; i++) cin >> c[t][i];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}