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: Accepted)

#include<stdio.h>
#define N 100000

int a,A[N];

int se(int rig,int A[],int k);
int main(){
 
  int b,bValue;
  int i,c=0;
  scanf("%d",&a);
  for(i=0;i<a;i++){
    scanf("%d",&A[i]);
  }
  scanf("%d",&b);
  for(i=0;i<b;i++){
    scanf("%d",&bValue);
    if(se(a,A,bValue)==1)c++;
  }

  printf("%d\n",c);
  return 0;
}
int se(int rig,int A[],int k){
  int lef=0;
  int mid=0;
  while(lef<rig){
    mid=(lef+rig)/2;
    if(A[mid]>k)rig=mid;
    else if(A[mid]<k)lef=mid+1; 
    else return 1;
  }
  return 0;
}