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 JAVA (judge verdict: Accepted)

import java.util.Scanner;

public class Main {
	public static int linearSearch(int[] input, int[] toFind) {
		int result = 0;
		
		for (int i = 0; i < toFind.length; i++) {
			for (int j = 0; j < input.length; j++) {
				if (toFind[i] == input[j]) {
					result++;
					break;
				}
			}
		}
		
		return result;
	}
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int[] input;
		int[] searchFor;
		int numInput;
		int numSearchFor;
		
		numInput = scanner.nextInt();
		input = new int[numInput];
		for (int i = 0; i < numInput; i++) {
			input[i] = scanner.nextInt();
		}
		
		numSearchFor = scanner.nextInt();
		searchFor = new int[numSearchFor];
		for (int i = 0; i < numSearchFor; i++) {
			searchFor[i] = scanner.nextInt();
		}
		
		scanner.close();
		
		System.out.println(linearSearch(input, searchFor));
	}
}