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>

int search(int);
#define N 1000001
int num_1[N];
int num_2[N];

int main(){

  int n,q;
  int i,j;
  int sum=0;

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

  scanf("%d",&q);
  
  for(j=0;j<q;j++){   
    scanf("%d",&num_2[j]);
  }
  
  for(j=0;j<q;j++){
    sum+=search(j);
      }

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

  return 0;
}

int search(int j){
  
  int i=0;
  num_1[N-1]=num_2[j];

  while(num_1[i]!=num_2[j]){   
    i++;
    if(i==N-1)return 0;
  }

  return 1;
}