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>
#define N 100000
#define Q 50000

int main(){
        int i=0,n,q,var[N],var2[Q],f=0,a,b,c;
        scanf("%d",&n);

        while(i<n) {
                scanf("%d",&var[i]);
                i++;
        }

        i=0;
        scanf("%d",&q);
        while(i<q) {
                scanf("%d",&var2[i]);
                i++;
        }

        for(i=0; i<q; i++) {
                a=0;
                b=n;
                while(a<b) {
                        c=(a+b)/2;
                        if(var2[i]==var[c]) {
                                f++;
                                break;
                        }
                        if(var2[i]>var[c])
                                a=c+1;
                        else if(var2[i]<var[c])
                                b=c;
                }
        }
        printf("%d\n",f);


        return 0;
}