//
//  main.cpp
//  dtcsu
//
//  Created by Catalina Brinza on 11/15/13.
//  Copyright (c) 2013 Catalina Brinza. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
int n=276997;
    vector<string> s;

bool cautare(string x,int m)
{int mij=0,i=0;
    while (s[mij]!=x && i<=m)
    {
        mij=i+(m-i)/2;
        if (s[mij]<x) i=mij+1;
        else m=mij-1;
 
    }
    if (s[mij]==x) return true;
    else return false;
}

int main()
{int i;
string c;
    for (i=1;i<=n;i++)
    { f>>c;
        s.push_back(c);
}
    int q;
    f>>q;
    int nr=0;
    int m=s.size();
    for (i=0;i<q;i++)
    {
        f>>c;
        if (cautare(c,m)) nr++;
    }
    g<<nr;
    return 0;
}