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

public class Main {

	public static final int BIG_NUM  = 2000000000;
	public static final int MOD  = 1000000007;

	public static void main(String[] args) {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		try {
			int N = Integer.parseInt(br.readLine());
			String[] input_S = new String[N];
			int[] array_S = new int[N];

			input_S = br.readLine().split("\\s+");
			for(int i = 0; i < N; i++){
				array_S[i] = Integer.parseInt(input_S[i]);
			}

			int Q = Integer.parseInt(br.readLine());
			String[] input_T = new String[Q];
			int tmp,ans = 0;

			input_T = br.readLine().split("\\s+");
			for(int i = 0; i < Q; i++){
				tmp = Integer.parseInt(input_T[i]);
				for(int k = 0; k < N; k++){
					if(tmp == array_S[k]){
						ans++;
						break;
					}
				}
			}

			System.out.println(ans);

		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}