#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <limits>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};

int calculate(const vector<int>& w, const vector<int>& b, bool white)
{
    int i = (int)w.size();
    int j = (int)b.size();
    int height = 0;
    int prevWidth = 1000000000;
    while(true)
    {
        if(white)
        {
            for(int index = i-1; index >= 0; index--)
            {
                if(prevWidth > w[index])
                {
                    height++;
                    i = index;
                    white = !white;
                    prevWidth = w[index];
                    break;
                }
            }
            if(white)
            {
                return height;
            }
        }
        else
        {
            for(int index = j-1; index >= 0; index--)
            {
                if(prevWidth > b[index])
                {
                    height++;
                    j = index;
                    white = !white;
                    prevWidth = b[index];
                    break;
                }
            }
            if(!white)
            {
                return height;
            }
        }
    }
}

int main() {

    int Nw;
    cin >> Nw;
    vector<int> w(Nw);
    
    FOR(i, Nw)
    {
        cin >> w[i];
    }
    
    int Nb;
    cin >> Nb;
    vector<int> b(Nb);
    FOR(i, Nb)
    {
        cin >> b[i];
    }
    sort(w.begin(), w.end());
    sort(b.begin(), b.end());

    int fromW = calculate(w, b, true);
    int fromB = calculate(w, b, false);
    cout << max(fromW, fromB) << endl;
    return 0;
}