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

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

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		//?¢???¢?´¢
		int n =  Integer.parseInt(br.readLine());
		String[] SStr = br.readLine().split(" ");
		int[] SInt = makeIntAry(n, SStr);

		//??¢?´¢
		int q =  Integer.parseInt(br.readLine());
		String[] TStr = br.readLine().split(" ");
		int[] TInt = makeIntAry(q, TStr);

		System.out.println(search(SInt, TInt));
	}

	public static int search(int[] searched,int[] search){
		int count = 0;
		for(int i = 0 ; i < search.length ; i++ ){
			searched[searched.length - 1] = search[i];
			int y = 0;
			while(searched[y] != search[i]){
				y++;
			}
			if(y != searched.length -1) count++;
		}
		return count;
	}

	public static int[] makeIntAry(int n, String[] strAry){
		int[] intAry = new int[n+1];
		int i = 0;
		while(i < n){
			intAry[i] = Integer.parseInt(strAry[i]);
			i++;
		}
		intAry[i] = 0;
		return intAry;
	}

}