#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "dtcsu";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 100005;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int N, Q, Ans;
char s[25];
bitset< 10000000000000005 > is;

inline void read() {
    for(int i = 1 ; i <= 276997 ; ++ i) {
        cin.getline(s, 20);
        int nr = 0;
        for(int j = 0 ; s[j] ; ++ j)
            nr = nr * 10 + (s[j] - '0');
        is[nr] = 1;
    }
}

int main() {
    read();
    cin >> Q;
    for(int i = 1 ; i <= Q ; ++ i) {
        int x;
        cin >> x;
        Ans += is[x];
        if(Ans > Q / 5)
            break;
    }
    cout << Ans << '\n';
    cin.close();
    cout.close();
    return 0;
}