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: Runtime Error)

object Main extends App {
  val in = io.Source.stdin.getLines.map(_.split(" ").map(_.toInt).toList).toList
  val src = in.filter(in.indexOf(_) % 2 != 0)

  def binarySearch(li: List[Int], n: Int): Option[Int] = li match {
    case h :: Nil => if (h == n) Some(n) else None
    case _ => {
      val midIndex = li.length / 2
      val midValue = li(midIndex)
      if (n < midValue) binarySearch(li.take(midIndex), n)
      else if (n > midValue) binarySearch(li.drop(midIndex), n)
      else Some(n)
    }
  }

  println((for (i <- src(1)) yield { binarySearch(src(0), i )}).filter(_ != None).length)
}