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 Control.Applicative
import Control.Monad
import Data.List
main = do
    n <- getLine
    s <- map read . words <$> getLine
    q <- getLine
    t <- map read . words <$> getLine
    let s' = qsort s
    let a = foldl' (+) 0 [1 | x <- t, binarysearch s' x]
    print a

qsort :: (Ord a) => [a] -> [a]
qsort [] = []
qsort (x:xs) = small ++ [x] ++ large
    where   small = [s | s <- xs, x > s]
            large = [l | l <- xs, x < l]

binarysearch :: [Int] -> Int -> Bool
binarysearch [] _ = False
binarysearch [x] n = x == n
binarysearch xs n
        | n == p = True
        | n <  p = binarysearch (take (m-1) xs) n
        | otherwise = binarysearch (drop m xs) n
        where   m = (length xs) `div` 2
                p = xs !! (m-1)