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: Runtime Error)

#include<stdio.h>
   
int main(){
    int S[100001],T[50001],U[10001];
    int i,j,lengh1,lengh2,count=0,count2=0,count3;
      int key;
    scanf("%d",&lengh1);
   
	for(i=1;i<=lengh1;i++){
        scanf("%d",&S[i]);}
       
    scanf("%d",&lengh2);
    for(i=1;i<=lengh2;i++){
        scanf("%d",&T[i]);
    }
       
	
	
    for(i=1;i<=lengh1;i++){
    	if(i>2 && S[i-1]<S[i-2]){
    		key=S[i];
				S[i]=S[i-1];
			S[i-1]=key;}
    	for(j=1;j<=lengh2;j++){
            if(S[i]==T[j]){ 
                count++;
                U[count]=T[j];}
              }}
     
     count2=count;
     
    for(i=1;i<=count2;i++){
        for(j=count2;j!=i;j--){
            if(U[j]==U[i]){
                count--;
                break;}
        }}
 
    printf("%d\n",count);
        
       
    return 0;
}