Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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.ArrayDeque
import java.util._
import java.io._
import scala.io.Source

object Main {
	val sc = new Scanner(System.in)
	def main(args: Array[String]): Unit = {
	  var count = 0
	  var n = sc.nextInt
	  var S = new Array[Int](n)
	  for(i <- 0 until n){
	    S(i) = sc.nextInt
	  }
	  var q = sc.nextInt
	  for(i <- 0 until q){
	    if(S.contains(sc.nextInt)){
	      count += 1
	    }
	  }
	  println(count)
	}
}