#include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>
#define nmax 276997
using namespace std;
long long x;
int i,n,j,k,nr;
char s[20];
set<long long>v;

long long parsare(char s[20])
{
   long long x=0;
   char *p=s;
   while (*p>='0' && *p<='9') x=x*10+*p-'0',++p;
   return x;
}

int main()
{
    freopen("dtcsu.in","r",stdin);
    freopen("dtcsu.out","w",stdout);
    for (i=1;i<=276997;i++) gets(s),v.insert(parsare(s));
    gets(s);
    n=parsare(s);
    for (i=1;i<=n;i++)
    {
        gets(s);
        x=parsare(s);
        if (v.count(x)) nr++;

    }
    printf("%d\n",nr);
    return 0;
}