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 = {
        val len = readInt
        val arr = readLine.split(" ").map(_.toLong)
        readInt
        val ret = readLine.split(" ").map(_.toLong).foldLeft(0) {(num, v) =>
            if (binSearch(v, arr, len)) num + 1 else num
        }
        println(ret)
    }
    def binSearch(needle: Long, arr: Array[Long], length: Int): Boolean = {
        def go(leftPtr: Int, rightPtr: Int): Boolean = ((leftPtr + rightPtr) / 2) match {
            case median if needle == arr(median) => true
            case median if  leftPtr == rightPtr => false 
            case median if needle > arr(median) => go(median + 1, rightPtr)
            case median if needle < arr(median) => go(leftPtr, median)
        }
        go(0, length - 1)
    }
}