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)

fun main(args: Array<String>) {
    readLine()
    val sArray = readLine()
        ?.split(" ".toRegex())
        ?.map(String::toInt)
        ?.toIntArray()
        ?: intArrayOf()
    readLine()
    val tArray = readLine()
        ?.split(" ".toRegex())
        ?.map(String::toInt)
        ?.toIntArray()
        ?: intArrayOf()
    println(tArray.filter {sArray.bSearch(it) != -1}.count())
}

fun IntArray.bSearch(key: Int, left: Int, right: Int): Int {
    val mid = (left + right) / 2
    if (left == mid) {
        if (this[mid] == key) {
            return mid
        } else {
            return -1
        }
    }
    if (this[mid] == key) {
        return mid
    } else if (this[mid] < key) {
        return this.bSearch(key, mid + 1, right)
    } else {
        return this.bSearch(key, left, mid)
    }
}

fun IntArray.bSearch(key: Int): Int {
    return this.bSearch(key, 0, this.size)
}