#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e6+3;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<int> a(n);
    REP(i,n) cin >> a[i];
    int m;cin >> m;
    vector<int> b(m);
    REP(i,m) cin >> b[i];
    vector<pair<int,int>> p;
    REP(i,n) p.push_back({a[i],0});
    REP(i,m) p.push_back({b[i],1});
    int ans=0;
    FOR(t,1,1<<(n+m)){
        vector<pair<int,int>> u;
        REP(i,n) if((t>>i)&1) u.push_back(p[i]);
        REP(i,m) if((t>>(i+n))&1) u.push_back(p[i+n]);
        sort(ALL(u));
        bool f=true;
        REP(i,u.size()-1){
            if(u[i].first==u[i+1].first) f=false;
            if(u[i].second==u[i+1].second) f=false;
        }
        if(f) chmax(ans,(int)u.size());
    }
    cout << ans << endl;
}