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 Scala (judge verdict: Accepted)

import scala.io.StdIn.{readLine, readInt};
object Main {
    def main(args: Array[String]): Unit = {
        readInt;
        val s = readLine.split(" ").map(_.toLong);
        readInt;
        val t = readLine.split(" ").map(_.toLong);
        val ret = t.foldLeft(0) { (cnt, i) => if (binSearch(i, s)) {cnt + 1}else {cnt}};
        println(ret);
    }
    
    def binSearch(target: Long, arr: Array[Long]): Boolean = {
        def go(first: Int, last: Int): Boolean = {
            val pivot = (first + last) / 2;
            if (target == arr(pivot)) true;
            else if (first == last) false;
            else if (target < arr(pivot)) go(first, pivot);
            else go(pivot + 1, last);
        }
        go(0, arr.length - 1);
    }
}