#include <bits/stdc++.h>
#include <atcoder/all>


using namespace std;
using namespace atcoder;
#define rep(i,m,n,k) for (int i = (int)(m); i < (int)(n); i += (int)(k))
#define rrep(i,m,n,k) for (int i = (int)(m); i > (int)(n); i += (int)(k))
#define ll long long
#define list(T,A,N) vector<T> A(N);for(int i=0;i<(int)(N);i++){cin >> A[i];}
long long  power_mod(long long n, long long k, long long mod) {
    long  result = 1;
    // k を右シフトしつつ n を 2 乗していく
    while (k > 0) {
        // k の最下ビットが 1 なら、今の n を答えに掛ける
        if ((k & 1) == 1) result = (result * n) % mod;
        n = n * n % mod;
        k >>= 1;
    }
    return result;
}
template <class T>
map<T,ll> Counter(vector<T> A){
    map<T,ll> m;
    for(auto a:A) m[a]++;
    return m;
} 

int main(){
    ll N,M;
    cin >> N;
    list(ll,W,N);
    cin >> M;
    list(ll,B,M);
    vector<pair<ll,ll>> X;
    rep(i,0,N,1){
        X.push_back({W[i],0});
    }
    rep(i,0,M,1){
        X.push_back({B[i],1});
    }
    sort(X.begin(),X.end());
    vector<ll> ans(N+M,1);
    rep(i,1,N+M,1){
        auto [l,x] = X[i];
        rep(j,0,i,1){
            auto [val,y] = X[j];
            if (x!=y){
                if (val!=l){
                    ans[i] = max(ans[i],ans[j]+1);
                }
            }
        }
    }
    cout << *max_element(ans.begin(),ans.end()) << endl;
    return 0;
}