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

using System;

namespace ALDS1_4A_1 {
    public class Program {
        public static void Main(string[] args) {
            var n = int.Parse(Console.ReadLine());
            var an = Array.ConvertAll(Console.ReadLine().Trim().Split(' '), int.Parse);
            Console.ReadLine();
            var tq = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            Array.Sort(an);

            var cnt = 0;
            foreach(var t in tq) {
                var left = 0;
                var right = n;
                while(left < right) {
                    var mid = (left + right) / 2;
                    if(an[mid] == t) {
                        cnt++;
                        break;
                    }

                    if(t < an[mid]) right = mid;
                    else left = mid + 1;
                }
            }

            Console.WriteLine(cnt);
        }
    }
}