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>

void selectionsort(int s[],int n){
  int min=0,a;
  for(int i=0;i<n;i++){
    min=i;
    for(int j=i;j<n;j++){
      if(s[j]<s[min])min=j;
    }
    a=s[i];
    s[i]=s[min];
    s[min]=a;
  }
}

int main(void){
  int n,q,cnt=0,mid,key;
  scanf("%d",&n);
  int s[n];
  for(int i=0;i<n;i++){
    scanf("%d",&s[i]);
  }
  scanf("%d",&q);
  int t[q];
  for(int i=0;i<q;i++){
    scanf("%d",&t[i]);
  }
  selectionsort(s,n);
  mid=n/2;
  for(int i=0;i<q;i++){
    key=t[i];
    if(s[mid]<=key){
      for(int j=mid;j<n;j++){
        if(key==s[j]){
          cnt++;
          break;
        }
      }
    }
    else if(s[mid]>key){
      for(int j=0;j<mid;j++){
        if(key==s[j]){
          cnt++;
          break;
        }
      }
    }
  }
    
  printf("%d\n",cnt);

  return 0;
}