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: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	    
		try {
			int lima = Integer.parseInt(in.readLine());
			String[] sa = in.readLine().split(" ");
			
			int limb = Integer.parseInt(in.readLine());
			String[] sb = in.readLine().split(" ");

			int[] a = new int[lima];
			int[] b = new int[limb];

			for (int i = 0; i < lima; i++) {
				a[i] = Integer.parseInt(sa[i]);
			}
			
			for (int i = 0; i < limb; i++) {
				b[i] = Integer.parseInt(sb[i]);
			}
			
			Arrays.sort(a);
			Arrays.sort(b);
			
			int hit = 0;
			boolean[] flag = new boolean[limb];
			for (int i = 0; i < limb; i++) {
				flag[i] = false;
			}
			
			for (int j = 0; j < limb; j++) {
				if (flag[j]) continue;

				int s = 0;
				int g = lima - 1;	
				int i = (s + g) / 2;
				while (s <= g) {
					if (b[j] > a[i]) {
						s = i + 1;
					} else if (b[j] == a[i]) {
						flag[j] = true;
						hit++;
						break;
					} else {
						g = i - 1;
					}
					i = (s + g) / 2;
				}
			}
			
			System.out.println(hit);
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}