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.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		
		int n = stdIn.nextInt();
		int[] s = new int[n];
		for (int i = 0; i < n; i++)
			s[i] = stdIn.nextInt();
		
		int q = stdIn.nextInt();
		int[] t = new int[q];
		for (int i = 0; i < q; i++)
			t[i] = stdIn.nextInt();
		
		int c = linearSearch(s, t);
		System.out.println(c);
	}
	
	public static int linearSearch(int[] a, int[] b) {
		int count = 0;
		for (int i = 0; i < b.length; i++)
			for(int j = 0; j < a.length; j++)
				if (b[i] == a[j])
					count++;
		
		return count;
	}
}