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

-- import Debug.Trace


binarySearch :: (V.Vector Int, Int, Int) -> Int -> Bool
binarySearch (vec, s, e) a
  | v == a = True
  | s == e = False
  | v >  a = binarySearch (vec, s, n - 1) a
  | v <  a = binarySearch (vec, n + 1, e) a
  where
    n = div (s + e) 2
    v = vec V.! n

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