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


public class Test
{
	public static void Main( )
	{
		int n = int.Parse( Console.ReadLine().Trim() );
		int[] S = new int[n];
		S = Console.ReadLine().Trim().Split().Select( x => int.Parse( x )  ).ToArray();
		
		int q = int.Parse( Console.ReadLine().Trim() );
		int[] T = new int[q];
		T = Console.ReadLine().Trim().Split().Select( x => int.Parse( x )  ).ToArray();

		int cnt = 0;
		for( int i=0; i<q; i++ ) {
			for( int j=0; j<n; j++ ) {
				if( T[i] == S[j] ) {
					cnt++;
					break;
				}
			}
		}
		Console.WriteLine( cnt );
		return;
	}
}