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.io.BufferedReader;
//import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		//System.setIn(new FileInputStream("./ALDS1_4_A-in10.txt"));
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int[] s = new int[n+1];
		String[] l = br.readLine().split(" ");
		for(int i = 0; i < n; ++i){
			s[i] = Integer.parseInt(l[i]);
		}
		int q = Integer.parseInt(br.readLine());
		l = br.readLine().split(" ");
		int[] t = new int[q];
		for(int i = 0; i < q; ++i) {
			t[i] = Integer.parseInt(l[i]);
		}
		//long start = System.nanoTime();
		int cnt = 0;
		for(int i = 0; i < q; ++i) {
			s[n] = t[i];
			int j = 0;
			while(t[i] != s[j]) {
				j += 1;
			}
			if(j != n){
				cnt += 1;
			}
		}
		System.out.println(cnt);
		/*System.out.println("Time:" + (System.nanoTime() - start) / 1000000f + " ms");

		start = System.nanoTime();
		cnt = 0;
		for(int i = 0; i < q; ++i) {
			for(int j = 0; j < n; ++j){
				if(s[j] == t[i]){
					cnt++;
					break;
				}
			}
		}
		System.out.println(cnt);
		System.out.println("Time:" + (System.nanoTime() - start) / 1000000f + " ms");
		*/
	}

}