Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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 Control.Applicative

lSearch :: [Int] -> Int -> Bool
lSearch [] _ = False
lSearch (x:xs) q
  | x == q = True
  |otherwise = lSearch xs q

solver :: [Int] -> [Int] -> Int
solver ss qs =
  let bAns = map (lSearch ss) qs
  in
      length $ filter (== True) bAns

main :: IO()
main = do
  _ <- getLine
  ss <- map (read :: String -> Int) . words <$> getLine
  _ <- getLine
  qs <- map (read :: String -> Int) . words <$> getLine
  print $ solver ss qs