#include <cstdio>
#include <vector>
#define MOD 666013
#define n 276997
using namespace std;

int q,x;
vector<long long> Hash[MOD];
inline void insert(int x){
    int List = x % MOD;
    Hash[List].push_back(x);
}
inline bool find_value(int x){
    int List = x % MOD;
    vector<long long> :: iterator  it;
    for(it = Hash[List].begin(); it != Hash[List].end(); ++it)
        if(*it == x)
            return 1;
    return 0;
}
int main()
{
    freopen("dtcsu.in", "r", stdin);
    freopen("dtcsu.out", "w", stdout);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &x);
        insert(x);
    }
    scanf("%d", &q);
    int SOL = 0;
    for(int i = 1; i <= q; ++i){
        scanf("%d", &x);
        if(find_value(x) == 1)
            ++SOL;
    }printf("%d", SOL);
    return 0;
}