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

public class Main {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		
		int n, q;
		int[] s;
		int t;
		int j;
		int ans = 0;

		n = scan.nextInt();
		s = new int[n];
		for(int i = 0; i <= n - 1; i++){
			s[i] = scan.nextInt();
		}
		
		q = scan.nextInt();
		for(int i = 0; i < q; i++){
			t = scan.nextInt();
			ans += linearSearch(s, t);
		}
		System.out.println(ans);
	}
	
	public static int linearSearch(int[] a, int key){
		int i = 0;
		a[a.length - 1] = key;
		while(a[i] != key){
			i++;
			if(i == a.length - 1)return 0;
		}
		return 1;
	}
}