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++14 (judge verdict: Time Limit Exceeded)

#include<iostream>
using namespace std;

int main(){
    int n,q;
    cin>>n;
    int* S=new int[n];
    int number;
    for(int i;i<n;++i){
        cin>>number;
        S[i]=number;
    }
    cin>>q;
    int* T=new int[q];
    for(int i=0;i<q;++i){
        cin>>number;
        T[i]=number;
    }
    int cnt=0;
    
    for(int i=0;i<q;++i){
        int left=0,right=n;
        while(left<right){
            int mid=(left+right)/2;
            if(S[mid]==T[i]){
                cnt++;
                break;
            }
            else if(S[mid]>T[i]){
                right=mid;
            }
            else if(S[mid]<T[i]){
                left=mid;
            }
        }
    }

    cout<<cnt<<"\n";
    delete[] T;
    delete[] S;
}