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 void main (String args[]) {
		
	//input array length/initialize array S of length n
	Scanner scan = new Scanner(System.in);
	int arrayLenS = scan.nextInt();
	int[] arrayS = new int[arrayLenS];
	
	//int[] myArray = {1, 2, 3, 4, 5, 6};
	
	//create first array S
	for(int i = 0; i < arrayLenS; i++) {
		int arrayNumsS = scan.nextInt();
		arrayS[i] = arrayNumsS;
	}
	
	//initialize length of array T -- enter array length q
	int arrayLenT = scan.nextInt();
	int[] arrayT = new int[arrayLenT];
	
	//create second array T
	for(int i = 0; i < arrayLenT; i++) {
		int arrayNumsT = scan.nextInt();
		arrayT[i] = arrayNumsT;
	}	
	
	//count number of matches between the arrays
   	int matchCount = 0;
	for(int i = 0; i < arrayT.length; i++) {
		for(int j = 0; j < arrayS.length; j++) {
			if(arrayS[j]==arrayT[i]) {
				matchCount += 1;
				break;	
			}
		}
	}
	System.out.println(matchCount);
	
	}
}