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>

int binarySearch(int s[],int key,int head,int tail){
    if(head>tail)return 0;
    
    int mid=(head+tail)/2;
    if(s[mid]==key)return 1;
    else if(s[mid]>key)tail=mid-1;
    else head=mid+1;
    
    return binarySearch(s,key,head,tail);
}

int main(void){
    int i;
    
    int n;
    scanf("%d\n",&n);
    int s[n];
    for(i=0;i<n;i++)scanf("%d",&s[i]);
    
    int q;
    scanf("%d\n",&q);
    
    int t;
    int count=0;
    while(q--){
        scanf("%d",&t);
        count+=binarySearch(s,t,0,n-1);
    }
    printf("%d\n",count);
    
    return 0;
}