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

object Main extends App {

  val n = StdIn.readLine().trim.toInt
  val lst1 = StdIn.readLine().trim.split(' ').map(_.toInt)
  val t = StdIn.readLine().trim.toInt
  val lst2 = StdIn.readLine().trim.split(' ').map(_.toInt)

  def search(key: Int): Boolean = {
    var left = 0
    var right = n
    var ret = false
    while(left < right && !ret) {
      val mid = (right + left) / 2
      if (lst1(mid) == key) {
        ret = true
      } else if(key < lst1(mid)) {
        right = mid
      } else {
        left = mid + 1
      }
    }
    ret
  }

  val result = lst2.foldLeft(0){ (acc, e) =>

    if(search(e)) acc + 1 else acc
  }
  
  println(result)

}