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;
using System.Linq;
using System.Collections.Generic;

namespace myApp
{
    class Program
    {
        static bool LinearSearch(int[] A, int n, int key) {
            int i = 0;
            A[n] = key; // 番兵
            while (A[i] != key) i++;
            return i != n;
        }
        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var S = new int[100000 + 1];
            var temp = Console.ReadLine().Split(' ').Select(str => int.Parse(str)).ToArray();
            Array.Copy(temp, S, n);

            var q = int.Parse(Console.ReadLine());
            var T = Console.ReadLine().Split(' ').Select(str => int.Parse(str)).ToArray();

            var sum = 0;
            for (int i = 0; i < q; i++) {
                if (LinearSearch(S, n, T[i])) sum++;
            }

            Console.WriteLine(sum);
        }
    }
}