#include <cstdio>
#include <set>
using namespace std;

long long X;
int Q;
set<long long> H;

int main() {
    freopen("dtcsu.in","r", stdin);
    freopen("dtcsu.out", "w", stdout);
    
    for (int i=0; i<276997; ++i) {
        scanf("%lld", &X);
        H.insert(X);
    }
    
    scanf("%d", &Q);
    int total = 0;
    for (int i=0; i<Q; ++i) {
        scanf("%lld", &X);
        if (H.find(X) != H.end()) ++total;
    }
    printf("%d\n", total);
    
    return 0;
}