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: Wrong Answer)

using System;

public class Program
{
	public static bool search(int[] A, int n, int key)
	{
		int i = 0;
		A[n] = key;
		while(A[i] != key) i++;
		return true;
	}

	public static int Main()
	{
		int i, n, q, key, sum = 0;
		int[] A = new int[10000+1];


		n = int.Parse(Console.ReadLine());
		string[] line = Console.ReadLine().Split(' ');
		for( i = 0; i < n; i++) {
			A[i] = int.Parse(line[i]);
		}

		q = int.Parse(Console.ReadLine());
		string[] strKey = Console.ReadLine().Split(' ');
		for( i = 0; i < q; i++) {
			key = int.Parse(strKey[i]);
			if (search(A, n, key)) sum++;
		}

		Console.WriteLine("{0}",sum);
		return 0;
	}
}