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: Time Limit Exceeded)

#include <iostream>
using namespace std;

int n,q;
int answer_count = 0;
void binary_search(int size, int v){
    int m = size;
    
}

int main(int argc, const char * argv[]) {
    cin >> n;
    int S[n];
    
    for (int i=0; i<n; i++) {
        cin >> S[i];
    }
    cin >> q;
    int T[q];
    for (int i=0; i<q; i++) {
        cin >> T[i];
    }
    
    for (int i=0; i<q; i++) {
        int target = T[i];
        int m = n;
        int l = 0;
        
        int mid;
        while(m>l){
            mid = (m+l)/2;
            if(S[mid] == target) {
                answer_count++;
                break;
            }else if(S[mid]>target){
                m = mid;
                
            }else {
                l = mid;
            }
        }
    }
    cout << answer_count;
    return 0;
}