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: Time Limit Exceeded)

#include<stdio.h>
int main(void){
   int a[10],b[10];
   int i,j,num,key,found=0;
   scanf("%d",&num);
   printf("\n");
   for(i=0;i<num;i++){
   scanf("%d",&a[i]);}
   printf("\n");
   scanf("%d",&key);
   printf("\n");
   for(j=0;j=key;j++){
   scanf("%d",&b[j]);}
   for(i=0;i<num;i++){
   if(b[j]==a[i]){
   found=1;
break;}}
if(found==1){
   printf("%d",i+1);}
else
   printf("0");
return 0;
}