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 ALDS1_4_A_LinearSearch
{
	class Program
	{
		static void Main ( string[] args )
		{
			//input
			int arraySize = int.Parse (Console.ReadLine ());
			int[] searchArray = new int[arraySize + 1];

			string[] inputStr = Console.ReadLine ().Split (' ');
			for (int index = 0; index < inputStr.Length; index++)
			{
				searchArray[index] = int.Parse (inputStr[index]);
			}

			int arraySize2 = int.Parse (Console.ReadLine ());
			int[] elementArray = new int[arraySize2];

			inputStr = Console.ReadLine ().Split (' ');
			for (int index = 0; index < inputStr.Length; index++)
			{
				elementArray[index] = int.Parse (inputStr[index]);
			}

			//search
			int findCount = 0;
			int lastIndex = arraySize;

			foreach (var item in elementArray)
			{
				int index = 0;
				searchArray[arraySize] = item;

				while (item != searchArray[index])
				{
					index++;
				}

				if (index != lastIndex)
				{
					findCount++;
				}
			}

			Console.WriteLine (findCount);
		}
	}
}