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.{readInt, readLine}

object Main extends App {
  val n = readInt
  val numbers = readLine.split(" ").map(_.toInt)
  val q = readInt
  var ans = 0
  readLine.split(" ").foreach( key => {
    ans += binarySearch(numbers, key.toInt)
  })
  println(ans)

  def binarySearch(numbers: Array[Int], key: Int): Int = {
    var start = 0
    var end = numbers.length - 1
    while (true) {
      val mid = (start + end) / 2
      if (numbers(mid) == key) {
        return 1
      }
      if (numbers(mid) < key) {
        start = mid + 1
      } else {
        end = mid - 1
      }
      if (start > end || start < 0 || end > numbers.length - 1) {
        return 0
      }
    }
    0
  }
}