Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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: Wrong Answer)

import java.util.ArrayList;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		ArrayList<Integer> numList01 = new ArrayList<Integer>();
		for (int i = 0; i < n; i++) {
			numList01.add(i, scanner.nextInt());
		}
		int m = scanner.nextInt();
		ArrayList<Integer> numList02 = new ArrayList<Integer>();
		for (int i = 0; i < m; i++) {
			numList02.add(i, scanner.nextInt());
		}

		int count = 0;
		for (int i = 0; i < m; i++) {
			if(numList01.get(n - 1) < numList02.get(i)){
				if (numList01.contains(numList02.get(i))) {
					count++;
				}
			}
		}
		System.out.println(count);
		scanner.close();
	}
}