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>
#define MAX 100000

int main(){
  
  int i,j,n1,n2,ans=0,flag=0;
  int arr1[MAX],arr2[MAX];

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

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

  for(i=0;i<n2;i++){
    for(j=0;j<n1;j++){
      if(arr2[i]==arr1[j]){
	flag = 1;
	ans++;
	if(flag = 1){
	  break;
	}
      }
    }
  }
 


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

  return 0;
}