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 C (judge verdict: Time Limit Exceeded)

#include<stdio.h>
main()
{
  int i,j,n,q,cnt=0;
  int left,right,mid;
  int S[100000],T[50000];
  scanf("%d",&n);
  for(i = 0; i < n; i++) {
    scanf("%d",&S[i]);
  }
  scanf("%d",&q);
  for(j = 0; j < q; j++) {
    scanf("%d",&T[j]);
    left = 0;
    right = q;
    while(left < right) {
      mid = (left + right)/2;
      if(T[j] == S[mid]) {
	cnt++;
      }
      if(T[j] > S[mid]) {
	left = mid + 1;
      }
      else if(T[j] < S[mid]) {
	right = mid;
      }
    }
  }
    printf("%d",cnt);
    return 0;
}