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{
  def main(args:Array[String]) : Unit = {
      val sc = new java.util.Scanner(System.in)
      val n = sc.nextInt
      val list = List.fill(n)(sc.nextInt)
      val q = sc.nextInt
      val queries = List.fill(q)(sc.nextInt)
      val contained = queries.filter(binarySearch(list, _))
      println(contained.size)
  }
  def binarySearch(list: List[Int], n: Int) : Boolean = {
    val l = list.size
    if (l==0) false
    else if (list(l/2) > n ) binarySearch(list.slice(0, l/2), n)
    else if (list(l/2) == n) true
    else binarySearch(list.slice((l/2) + 1, list.size), n)
  }
}