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_4_A
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.ReadLine();
            string[] s = getsplit();
            Console.ReadLine();
            string[] t = getsplit();
            
            int count = 0;

            foreach (string T in t)
            {
                foreach (string S in s)
                {
                    if (S == T)
                    {
                        count++;
                        break;
                    }
                }
            }
        
            Console.WriteLine(count);

        }
        public static int getint(string a)
        {

            if (a == null)
            {
                int x = int.Parse(Console.ReadLine());
                return x;
            }
            else
            {
                int x = int.Parse(a);
                return x;
            }
        }
        public static string[] getsplit()
        {
            string[] x = Console.ReadLine().Split(' ');
            return x;
        }
    }
}