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 Contest.cs
{
	class Program
	{
		static void Main(string[] args)
		{
			ReadStr();
			var S = ReadInt();
			ReadStr();
			var T = ReadInt();
			var Con = new int[S.Length + T.Length + 1];
			int ans = 0;
			T.CopyTo(Con, 0);
			S.CopyTo(Con, T.Length);
			for(var i = 0;i < T.Length; i++)
			{
				Con[Con.Length - 1] = Con[i];
				var target = Con[i];
				int j = T.Length;
				while (true)
				{
					if (Con[j] == target) break;
					j++;
				}
				if (j != Con.Length - 1) ans++;
			}
			Console.WriteLine(ans);
		}

		static string[] ReadStr()
		{
			return Console.ReadLine().Split(' ').ToArray();

		}

		static int[] ReadInt()
		{
			return Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
		}
	}
}