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 count(int[] sorted, int[] intSet) {
		
		int result = 0;
		
		for(int i = 0; i < intSet.length; i++) {
			
			for(int j = 0; j < sorted.length; j++) {
				
				if(intSet[i] == sorted[j]) {
					result++;
					break;
				}
			}
		}
		return result;
	}

	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int numSorted = in.nextInt();
		int[] sorted = new int[numSorted];
		
		for(int i = 0; i < numSorted; i++) {

			sorted[i] = in.nextInt();

		}
		
		int setNum = in.nextInt(); 
		int[] intSet = new int[setNum];

		for(int j = 0; j < setNum; j++) {

			intSet[j] = in.nextInt();

		}

		int result = count(sorted, intSet);

		System.out.println(result);


		in.close();
		
	}

}