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.*;

//Linear Search
public class Main {
    public static void main(String[] args) {
        int count = 0;
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[10000 + 1];
        for(int i = 0; i<n; i++){
            A[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        int[] Key = new int[10000 + 1];
        for(int i = 0; i<q; i++){
            Key[i] = sc.nextInt();
            if(search(A, n, q, Key[i]) == 1){
                count++;
            }
        }
        System.out.println(count);

    }

    public static int search(int[] A, int n, int q, int Key) {
        int i, j;
        int sum = 0;
        for(i = 0; i<n; i++){
                if(Key != A[i]){
                    sum++;
                }
        }
        if(sum == n){
            return 0;
        }
        return 1;
    }
}