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>) {

    Main.init()

    Main.execute()
}

class Main {

    companion object {

        private lateinit var inputs: List<Int>

        private lateinit var searchLists: List<Int>

        fun init() {

            readLine()

            inputs = readLine()!!.split(" ").map { it.toInt() }

            readLine()

            searchLists = readLine()!!.split(" ").map { it.toInt() }

        }

        fun execute() {

            println(searchLists.count {
                isInclude(it)
            })
        }

        fun isInclude(searchString: Int): Boolean {

            /**
             * leftとrightは探索済みとして扱うので、存在しないindexを設定することがコツ
             */
            var leftIndex = -1
            var rightIndex = inputs.size

            var targetIndex = (leftIndex + rightIndex) / 2

            while (true) {

                val targetValue = inputs[targetIndex]
                if (targetValue == searchString) {
                    return true
                }

                if (targetValue < searchString) {
                    // 小さいので、leftを移動
                    leftIndex = targetIndex
                } else {
                    // 大きいので、rightを移動
                    rightIndex = targetIndex
                }

                if (rightIndex - leftIndex == 1) {
                    return false
                }

                targetIndex = (leftIndex + rightIndex) / 2
            }
        }
    }
}