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: Time Limit Exceeded)

import Data.List
import qualified Data.ByteString.Char8 as BC
import Data.Maybe (fromJust)
import Control.Monad
import Data.Functor

readInts :: IO [Int]
readInts = map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine

main :: IO()
main = do
  _ <- fmap read getLine :: IO Int
  --ss <- fmap (map read . words) getLine :: IO [Int]
  ss <- readInts
  _ <- fmap read getLine :: IO Int
  --ts <- fmap (map read . words) getLine :: IO [Int]
  ts <- readInts
  print $ solve ss ts 0

solve :: [Int] -> [Int] -> Int -> Int
--solve ss = foldl' (\acc t -> acc + binarySearch t ss 0 (length ss - 1)) 0
--solve ss ts = length [1 | t <- ts, binarySearch t ss 0 (length ss - 1)]
solve _ [] n = n
solve ss (t:ts) n = solve ss ts $ n + if elem t ss then 1 else 0

binarySearch :: Int -> [Int] -> Int -> Int -> Bool
binarySearch t ss b e
  | t == mid = True
  | b == e || b > e  = False
  | t < mid = binarySearch t ss b (i - 1)
  | t > mid = binarySearch t ss (i + 1) e
  where
    i = div (b + e) 2
    mid = ss !! i