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 A
{
    class A
    {
        static void Main(string[] args)
        {
            int n, q, i, count=0;
            string a;
            string[] b = new string[30000];
            int[] S = new int[10000];
            int[] T = new int[10000];
            LinerSearch search = new LinerSearch();
            a = Console.ReadLine();
            n = int.Parse(a);
            b = Console.ReadLine().Split(' ');
            for (i=0; i<n; i++)
            {
                S[i] = int.Parse(b[i]);
            }
            a = Console.ReadLine();
            q = int.Parse(a);
            b = Console.ReadLine().Split(' ');
            for (i=0; i<q; i++)
            {
                T[i] = int.Parse(b[i]);
            }

            for (i=0; i<q; i++)
            {
                count = count + search.search(S, T[i], n);
            }

            Console.WriteLine(count);
            
        }
    }

    class LinerSearch
    {
        int i;
        public int search(int[] A, int key, int a)
        {
            for (i = 0; i < a; i++)
            {
                if (A[i] == key)
                {
                    return 1;
                }
            }
            return 0;
        }
    }
}