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 main(){
int i,s,n1,t,n2,teto[N],teto2[N],count=0;
int lef,mid,ri;
scanf("%d",&n1);
for(i=0;i<n1;i++){
scanf("%d",&teto[i]);
}
scanf("%d",&n2);
for(i=0;i<n2;i++){
scanf("%d",&teto2[i]);
}
for(i=0;i<n2;i++){
ri=n1-1;
lef=0;
while(lef<ri){
mid=(lef+ri)/2;
if(teto[mid]==teto2[i]||teto[lef]==teto2[i]||teto[ri]==teto2[i]){
count++;
break;
}
else if(teto[mid]<teto2[i]){
lef=mid+1;
}
else{
ri=mid;
}
}
}



printf("%d\n",count);


return 0;
}