Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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 Haskell (judge verdict: Accepted)

import Data.List

nub' :: [Int] -> [Int]
nub' [] = []
nub' (x:[]) = [x]
nub' (x0:x1:xs) =
  if x0 == x1
  then nub' (x1:xs)
  else x0:(nub' (x1:xs))

ans' [] _ = []
ans' _ [] = []
ans' (s:ss) (q:qs) =
  if s == q
  then s:(ans' ss qs)
  else
    if s > q
    then ans' (s:ss) qs
    else ans' ss (q:qs)

ans s q =
  let s' = nub' $ sort s
      q' = nub' $ sort q
  in
    length $ ans' q' s'

main = do
  getLine
  s' <- getLine
  getLine
  q' <- getLine
  let s = map read $ words s' :: [Int]
      q = map read $ words q' :: [Int]
      o = ans s q
  print o