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: Wrong Answer)

import java.util.*;
public class Main{
  static boolean BinSearch(int[] a, int key){
    int mid = a.length / 2;
    int upp = a.length - 1;
    int low = 0;
    while(upp-low>=1){
      if(a[mid]==key){
        return true;
      }
      else if(a[mid]>key){
        upp = mid - 1;
        mid = (upp+low) / 2;
      }
      else{
        low = mid + 1;
        mid = (upp+low) / 2;
      }
    }
    return false;
  }
    
  public static void main(String[] args){
    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 p = sc.nextInt();
    int[] q = new int[p];
    for(int i=0; i<p; i++){
      q[i] = sc.nextInt();
    }
    int ans = 0;
    for(int i=0; i<p; i++){
      if(BinSearch(s, q[i])==true){
        ans++;
      }
    }
    System.out.println(ans);
  }
}