Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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: Memory Limit Exceeded)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
  public static void main (String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    int n = Integer.parseInt(br.readLine());
    int[] s = Arrays
        .asList(br.readLine().split(" "))
        .stream()
        .mapToInt(i->Integer.valueOf(i))
        .toArray();

    int q = Integer.parseInt(br.readLine());
    int[] t = Arrays
        .asList(br.readLine().split(" "))
        .stream()
        .mapToInt(i->Integer.valueOf(i))
        .toArray();

    int count = 0;
    for(int i : t) {
      if (binarySearch(s, i)) {
        count++;
      }
    }
    System.out.println(count);
  }

  private static boolean binarySearch(int[] arr, int searchNum) {
    int mid = arr.length / 2;
    if (arr[mid] == searchNum) {
      return true;
    } else if (arr.length <= 1) {
      return false;
    } else if (arr[mid] > searchNum) {
      int[] nextArr = Arrays.copyOfRange(arr, 0, mid);
      return binarySearch(nextArr, searchNum);
    } else {
      int[] nextArr = Arrays.copyOfRange(arr, mid, arr.length);
      return binarySearch(nextArr, searchNum);
    }
  }
}