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 java.util.Scanner

object Main extends App {

  val sc = new Scanner(Console.in)

  def nextInt() = sc.next.toInt

  val n = nextInt
  val s = Array.fill(n)(nextInt)

  val q = nextInt
  val t = Seq.fill(q)(nextInt)

  val c = (0 /: t) { (c, e) =>

    def find(xs: Array[Int]): Boolean = {
      def binarySearch(start: Int, end: Int): Boolean = {
        if (start == end)
          e == xs(start)
        else {
          val mid = start + (end - start + 1) / 2
          if (e < xs(mid))
            binarySearch(start, mid - 1)
          else
            binarySearch(mid, end)
        }
      }
      if (xs.length == 0) false
      else binarySearch(0, xs.length - 1)
    }

    if (find(s)) c + 1
    else c
  }
  println(c)
}