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.*;
// import java.io.*;
class Main{
  public static void main(String args[])throws Exception{
    // BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    Scanner sc = new Scanner(System.in);
    int count = 0;
    int number = 0;
    // int n = Integer.parseInt(br.readLine());
    int n = sc.nextInt();
    // String [] S = br.readLine().split("\\s+");
    long [] array_s = new long[n];
    for(int i =0; i<n; i++){
      array_s[i] = sc.nextLong();
    }

    // int q = Integer.parseInt(br.readLine());
    int q = sc.nextInt();
    // String [] T = br.readLine().split("\\s+");
    long [] array_t = new long[n];
    long t;
    for(int i = 0; i<q; i++){
      t = sc.nextLong();
      for(int j = 0; j<n; j++){
        if(t == array_s[j]){
          count++;
          break;
        }
      }
    }

    System.out.println(count);
  }
}