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 Kotlin (judge verdict: Accepted)

import java.util.*
import java.io.PrintWriter
val pw = PrintWriter(System.out)


fun main(args: Array<String>) {
    val n = nextInt()
    val S = nextListOfInt()
    val q = nextInt()
    val T = nextListOfInt()

    var ans = 0

    for(i in 0 until q){
        val key = T[i]
        if(binarySearch(S, key) != null) ans += 1
    }

    pw.println(ans)
    pw.flush()
    pw.println(n)

}

fun binarySearch(A: List<Int>, key: Int): Int?{
    var left = 0
    var right = A.size
    var mid: Int
    while(left < right){
        mid = (left + right) /2
        when {
            A[mid] == key -> {
                return mid
            }
            key < A[mid] -> {
                right = mid
            }
            else -> {
                left = mid + 1
            }
        }
    }
    return null
}

fun next() = readLine()!!
fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextDouble() = next().toDouble()
fun nextListOfString() = next().split(" ")
fun nextListOfInt() = nextListOfString().map { it.toInt() }
fun nextListOfLong() = nextListOfString().map { it.toLong() }
fun nextListOfDouble() = nextListOfString().map { it.toDouble() }