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 {
  def scan(a:Array[Int],value:Int,l:Int,r:Int):Boolean = {
    val mid = (l+r)/2
    if(a(mid) == value) true
    else if(l>=r) false
    else {
      val (new_l,new_r) = if(a(mid)<value) (mid+1,r) else (l,mid-1)
      scan(a,value,new_l,new_r)
    }
  }

  def search(a:Array[Int],value:Int) = {
    scan(a,value,0,a.length-1)
  }

  def main(args:Array[String]) = {
    readInt
    val s = readLine.split(" ").map(_.toInt).toArray
    readInt
    val t = readLine.split(" ").map(_.toInt).toArray
    println(t.count(i=> search(s,i)))
  }
}