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 qualified Data.Vector as V (Vector, fromList, length, (!))
import Control.Applicative


binarySearch :: V.Vector Int -> Int -> Bool
binarySearch vec a = loop (0, V.length vec - 1)
  where
    loop (start, end)
      | v == a       = True
      | start >= end = False
      | v > a        = loop (start, n - 1)
      | v < a        = loop (n + 1, end)
      where
        (n, v) = (div (start + end) 2, vec V.! n)

main :: IO ()
main = do
  _ <- getLine
  s <- map read . words <$> getLine
  _ <- getLine
  t <- map read . words <$> getLine
  print $ length $ filter (binarySearch $ V.fromList s) t