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 <stdio.h>
#include <stdlib.h>

void bubbleSort(int S[], long n){
    for(int i=0; i<n-1; i++){
        for(int j=i+1; j<n; j++){
            if(S[i] > S[j]){
                int buffer = S[i];
                S[i] = S[j];
                S[j] = buffer;
            }
        }
    }
}

int binarySearch(int S[], int T[], long n, int q){
    int counter=0;
    bubbleSort(S,n);
    bubbleSort(T,q);
    for(int i=0; i<n; i++){
        if(i!=n-1 && S[i]==S[i+1]) continue;
        int left = 0, right = q;
        // Searching algorithm
        while(left < right){
            int mid = (left+right)/2;
            if(S[i] == T[mid]){
                counter++;
                break;
            }
            else if(S[i] > T[mid]) left = mid + 1;
            else right = mid;
        }
    }
    return counter;
}

int main(){
    // Input n
    long n;
    scanf("%ld",&n);
    // Input S
    int S[n];
    for(int i=0; i<n; i++){
        scanf("%d",&S[i]);
    }
    // Inpupt q
    int q;
    scanf("%d",&q);
    // Input T
    int T[q];
    for(int i=0; i<q; i++){
        scanf("%d",&T[i]);
    }
    // Execution
    printf("%d\n",binarySearch(S,T,n,q));
    return 0;    
}