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.*;
class Main
{
    public static void main(String args[])throws IOException
    {
	BufferedReader input=new BufferedReader(new InputStreamReader(System.in));
	int n=Integer.parseInt(input.readLine());
	
	String str1=input.readLine();
	int m=Integer.parseInt(input.readLine());
	String str2=input.readLine();
	if(n>m)
	    {
		int tmp=n;
		n=m;
		m=tmp;
		String temp=str1;
		str1=str2;
		str2=temp;
	    }
	int b[]=new int[m];
	int a[]=new int[n];
	
	String str_ary1[]=str1.split(" ");
	for(int i=0;i<n;i++)
	    {
		a[i]=Integer.parseInt(str_ary1[i]);
	    }
	
	
	
	String str_ary2[]=str2.split(" ");
	for(int i=0;i<m;i++)
	    {
		b[i]=Integer.parseInt(str_ary2[i]);
	    }
	int x=0;
	for(int i=0;i<n;i++)
	    {
		for(int j=0;j<m;j++)
		    {
			if(a[i]==b[j])
			    {
				x++;
				break;
			    }
		    }
	    }
	System.out.println(x);
    }
}