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

public class hello
{
    public static void Main()
    {
        var s = new List<int>();
        var t = new List<int>();
        var n = int.Parse(Console.ReadLine().Trim());
        string[] line = Console.ReadLine().Trim().Split(' ');
        for (int i = 0; i < n; i++)
            s.Add(int.Parse(line[i]));
        var q = int.Parse(Console.ReadLine().Trim());
        string[] line2 = Console.ReadLine().Trim().Split(' ');
        for (int i = 0; i < q; i++)
            t.Add(int.Parse(line2[i]));
        var result = 0;
        foreach (var x in t)
            if (s.Any(xx => xx == x)) result += 1;
        Console.WriteLine(result);
    }
}