Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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>

main(void){
  
  int s[10000],n,t[500],q,i,count=0,j,temp;
  int left,mid,right,value;

  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&s[i]);
    
  }

  scanf("%d",&q);
  for(i=0;i<q;i++){
    scanf("%d",&t[i]);
  }
  
  for(i=0;i<n-1;i++){
    for(j=n-1;j>i;j--){
      if(s[j]<s[j-1]){
	temp=s[j];
	s[j]=s[j-1];
	s[j-1]=temp;
      }
    }
  }
    
  
  for(i=0;i<q;i++){
    right=n;
    left=0;
    value=t[i];
   
    while(left<=right){
      mid=(left+right)/2;

      if(s[mid]==value){
	count=count+1;
	break;
      }

      else if(s[mid]<value)left=mid+1;

      else right=mid-1;

    }
  }
  
  printf("%d\n",count);
  return 0;
}