#include<cstdio>
#include<fstream>
#include<queue>
#include<algorithm>
using namespace std;
ifstream f("dtcsu.in");
#define MaxChar 100000
#define verf ( (++CharB==MaxChar) ? ( f.read(Buffer,MaxChar),CharB=0 ) : (1) )
int CharB;
char ch,Buffer[MaxChar],sir[30];
void cit(long long &a)
{
    a=0;
    for (;!((Buffer[CharB]>='0'&&Buffer[ CharB ]<='9')||(Buffer[CharB]=='-'));verf);
    for (a=0;(Buffer[CharB]>='0'&&Buffer[CharB]<='9');a*=10,a+=(Buffer[CharB]-'0'),verf);
}
int i,p,u,mij,ras,n5,n7,n11,sol;
long long T,V,INF,a[276999];
int main()
{
freopen("dtcsu.out","w",stdout);
for(i=1;i<=276997;i++)
    cit(a[i]);
cit(T);
sort(a+1,a+276997+1);
while(T)
{
    T--;
    cit(V);
    p=1;
    u=276997;
    while(p<=u)
    {
        mij=(p+u)>>1;
        if(a[mij]>V) u=mij-1;
        else
        if(a[mij]<V) p=mij+1;
        else break;
    }
    if(p<=u) sol++;
}
printf("%d\n",sol);
return 0;
}