#include<bits/stdc++.h>
using namespace std;
unordered_set<long long> M;
long long x;
int q,sol;
int main()
{
    freopen("dtcsu.in","r",stdin);
    freopen("dtcsu.out","w",stdout);
    for(int i=1;i<=276997;i++)
    {
        scanf("%lld",&x);
        M.insert(x);
    }
    scanf("%d",&q);
    for(int i=1;i<=q;i++)
    {
        scanf("%lld",&x);
        if(M.count(x)) sol++;
    }
    printf("%d\n",sol);
    return 0;
}