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>
#define M 10000

int main(){
  int n, S[M], q, T[M], i ,j, count=0;

  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;i++){
    for(j=i+1;j<n;j++){
      if(S[i]==S[j])
	S[j]=-1;
    }
  }

  for(i=0;i<n;i++){
    for(j=i+1;j<n;j++){
      if(T[i]==T[j])
	T[j]=-1;
    }
  }
  
  for(i=0;i<q;i++){
    for(j=0;j<n;j++){
      if(T[i]==S[j])count++;
    }
  }

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