# 目次

• 目次
• 問題
• 解答

# 問題

# 解答

// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int int
#define loop(x, start, end) for(Int x = start; x < end; x++)
#define loopdown(x, start, end) for(int x = start; x > end; x--)
#define rep(n) for(int x = 0; x < n; x++)
#define span(a,x,y) a.begin()+x,a.begin()+y
#define span_all(a) a.begin(),a.end()
#define len(x) (x.size())
#define last(x) (*(x.end()-1))

using namespace std;

inline bool search(vector<ll> v, ll target) {
    if (target < v[0] || v[v.size()-1] < target) return false;
    
    ll left = 0, right = v.size(), mid;
    while (left < right) {
        mid = (left + right) / 2;
        if (v[mid] == target) return true;
        else if (v[mid] < target) left = mid+1;
        else right = mid;
    }
    
    return false;
}
 
int main(void) {
    ll n, q, x;
    vector<ll> vs, vt;
    
    cin >> n;
    ll i = 0;
    loop(i, 0, n) {
        cin >> x;
        vs.push_back(x);
    }
    
    cin >> q;
    
    ll count = 0;
    loop(i, 0, q) {
        cin >> x;
        if (search(vs, x)) count++;
    }
    
    cout << count << endl;
}