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.Arrays;
import java.util.Scanner;
public class Main {
    public static void main(String[] args){
        int ans=0;
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int[] S=new int[n];
        for(int i=0;i<n;i++){
            S[i]=sc.nextInt();
        }
        int q=sc.nextInt();
        int[] T=new int[q];
        for(int i=0;i<q;i++){
            T[i]=sc.nextInt();
        }
        Arrays.sort(S);
        Arrays.sort(T);
        int[] newS=new int[n+1];
        for(int i=0;i<n+1;i++)
            newS[i]=-1;
        newS[0]=S[0];
        int k=1;
        for(int i=1;i<n;i++){
            if(S[i]!=S[i-1])
                newS[k++]=S[i];
        }
        for(int i=0;i<q;i++){
            for(int j=0;newS[j]!=-1;j++){
                if(newS[j]==T[i]){
                    ans++;
                    break;
                }
            }
        }
        System.out.println(ans);
    }
}