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 PHP (judge verdict: Accepted)

<?php
$arr1=array();
$arr2=array();
$count=0;
//1行目の空白までのデータをもらって$n1に入れる
fscanf(STDIN,'%d',$n1);
//2行目の文字列をもらう
  $temp_arr1=fgets(STDIN);
//文字列から空白のスペースを取り除く
  $temp_arr1=trim($temp_arr1);
//空白を境目にして、文字列から配列を作る
  $arr1=explode(' ',$temp_arr1);
  // v($arr1);
  //2つめのデータの1行目の空白までのデータをもらって$n1に入れる
  fscanf(STDIN,'%d',$n2);
  //$arr1を作ったのと同じ作業を1行で済ませる
  $arr2=explode(' ',trim(fgets(STDIN)));


  foreach($arr2 as $a){
    if(in_array($a,$arr1)){
      $count++;
    }
  }
  echo $count . PHP_EOL;