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

const int NR = 276997 ;

#define maxs 20

int Q ;

set<int> numere ;

char sir[maxs] ;

int main()
{
    freopen("dtcsu.in", "r", stdin);
    freopen("dtcsu.out", "w", stdout);

    for(int i = 1; i <= NR; ++i )
    {
        scanf("%s\n", sir);

        int len = strlen(sir) ;
        long long x = 0 ;

        for(int j = 0; j < len; ++j )
            x = x * 10 + ( sir[j] - '0' ) ;

        numere.insert(x) ;
    }

    scanf("%d", &Q);

    int sol = 0 ;

    for(int i = 1; i <= Q; ++i )
    {
        scanf("%s\n", sir);

        int len = strlen(sir) ;
        long long qq = 0 ;

        for(int j = 0; j < len; ++j )
            qq = qq * 10 + ( sir[j] - '0' ) ;

        if( numere.find(qq) != numere.end() )
            ++sol ;
    }

    printf("%d", sol);

    return 0 ;
}