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;

namespace Search
{
    class Linear_Search
    {
        static void Main(string[] args)
        {
            Console.ReadLine();
            var S = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            Console.ReadLine();
            var T = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();

            var C = Count(S, T);
            Console.WriteLine(C);
        }

        public static int Count(int[] S,int[] T)
        {
            var C = 0;
            for (int i = 0; i < T.Length; i++)
                for (int j = 0; j < S.Length; j++)
                    if(T[i]==S[j])
                    {
                        C++;
                        break;
                    }
            return C;
        }
    }
}