#include<bits/stdc++.h>

using namespace std;

ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");

const int MOD=8192;
const int NIL=0;
const int MAXN=276997;

long long hasht[MAXN+1];
int lista[MOD],nxt[MOD],nrlist;

bool searching(long long x) {
    int val=x%MOD,i=lista[val];
    while(i!=NIL&&hasht[i]!=x) {
        i=nxt[i];
    }
    if(i!=NIL) {
        return true;
    }
    return false;
}

void adding(long long x) {
    int val=x%MOD;
    if(searching(x)==false) {
        ++nrlist;
        hasht[nrlist]=x;
        nxt[nrlist]=lista[val];
        lista[val]=nrlist;
    }
}

void read_input() {
    int n=276997;
    long long x;
    while(n--) {
        fin>>x;
        adding(x);
    }
}

void process_queries() {
    int res=0,num_queries;
    long long x;
    fin>>num_queries;
    while(num_queries--) {
        fin>>x;
        res+=searching(x);
    }
    fout<<res;
}

int main() {
    read_input();
    process_queries();
    return 0;
}