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)

import scala.io.StdIn._
import scala.annotation.tailrec

object Main {

  val f = (ar: List[Int]) => (a: Int) => (x: Int) => ar(x)-a

  //f(x) => (-1,0,1)
  @tailrec
  def binarySearch(f: Int => Int,l: Int, r: Int): Int = {
    if(r-l<=1)f(l)
    else if(f((l+r)/2) < 1)binarySearch(f,(l+r)/2,r)
    else binarySearch(f,l,(l+r)/2)
  }

  def loop(n: Int,in: Int, q: Int, cnt:Int,f: Int => Int => Int):Int = {
    if(q==0)cnt
    else loop(n,readInt,q-1,cnt+(if(0==binarySearch(f(in),0,n)) 1 else 0),f )
  }

  def main(args: Array[String]): Unit = {
    val n = readInt
    val list = readLine.split(" ").map(_.toInt).toList

    val q = readInt
    val qlist = readLine.split(" ").map(_.toInt)
    var res:Int = 0
    for(e <- qlist)res=res+(if(0 == binarySearch(f(list)(e),0,n)) 1 else 0)
    println(res)
    //val res = for(e <- qlist)yield(0 == binarySearch(f(list)(e),0,n))
    //println(res.toList.map(if(_) 1 else 0).sum)
    //println(loop(n,readInt,q,0,f(list)))
  }
}