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<stdio.h>
#include<stdbool.h>
#define MAX 100000

bool binarySearch(int);
bool flg;
int cnt=0;
int S[MAX],T[MAX];
int i,j,s,t;

int main(){
    scanf("%d",&s);
    for(i=0;i<s;i++){
        scanf("%d",&S[i]);
    }
    scanf("%d",&t);
    for(j=0;j<t;j++){
        scanf("%d",&T[j]);
    }
    for(j=0;j<t;j++){
        flg=binarySearch(T[j]);
        if(flg)cnt++;
    }

    
    printf("%d\n",cnt);
    return 0;
}
 
 
bool binarySearch(int Tnum){
    int left = 0;
    int right = s;
    while(left < right){
        int mid = (left + right)/2;
        if(S[mid] == Tnum){
            return true;
        }else if(Tnum < S[mid]){
            right = mid;
        }else{
            left = mid + 1;
        }
    }
    return false;
}