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)

// Linear_Search.cs

using System;
using System.Collections.Generic;

class Linear_Search {
	public static void Main() {

		int n = int.Parse(Console.ReadLine());
		int[] s = new int[n];
		string str = Console.ReadLine();
		string[] num = str.Split();

		for(int i = 0; i < n; i++) {
			s[i] = int.Parse(num[i]);
		}

		int m = int.Parse(Console.ReadLine());
		string str_s = Console.ReadLine();
		string[] num_s = str_s.Split();
		int[] search = new int[m];
		int[] ans = new int[m];
		for(int i = 0; i < m; i++) {
			search[i] = int.Parse(num_s[i]);
		}

		int count = 0;

		for(int j = 0; j < m; j++) {
			for(int i = 0; i < n; i++) {
				if(s[i] == search[j]) {
					ans[count] = search[j];
					count++;
				}
			}
		}

		List<int> numlist = new List<int>(ans);
		int len = numlist.Count, cc = 0;
		foreach(int k in numlist) {
			if(cc != len - 1)
			Console.Write(k + " ");
			else
			Console.WriteLine(k);
			cc++;
		}

	}
}