Problem:
Search II

You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.

Input

In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.

Output

Print C in a line.

Constraints

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

0 ≤ an element in S ≤ 109

0 ≤ an element in T ≤ 109

Sample Input 1

5
1 2 3 4 5
3
3 4 1

Sample Output 1

3

Sample Input 2

3
1 2 3
1
5

Sample Output 2

0

Sample Input 3

5
1 1 2 2 3
2
1 2

Sample Output 3

2

Notes

Solution in C++ (judge verdict: Accepted)

#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}



int main() {
    int n;
    cin >> n;
    vector<int>s(n);
    rep(i,n) cin >> s[i];
    int q;
    cin >> q;
    vector<int>t(q);
    rep(i,q) cin >> t[i];
    int sum = 0;
    rep(i,q) {
        int left = -1;
        int right = s.size();
        while(right - left > 1) {
            int mid = left + (right - left) / 2;
            if(s[mid] >= t[i]) right = mid;
            else left = mid;
        }
        if(s[right] == t[i]) sum++;
    }
    cout << sum << endl;
}