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.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
    static Scanner in;

    void solve() {
        int n = in.nextInt();
        Set<Integer> s = new HashSet<>();
        for(int i = 0; i < n; i++) {
            s.add(in.nextInt());
        }
        int q = in.nextInt();
        Set<Integer> t = new HashSet<>();
        for(int i = 0; i < q; i++) {
            t.add(in.nextInt());
        }
        int sum = 0;
        for(int i : s) {
            for(int j : t) {
                sum += i == j ? 1 : 0;
            }
        }

        System.out.println(sum);
    }

    public static void main(String[] args) {
        in = new Scanner(System.in);
        new Main().solve();
    }
}