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)

--bin search

import Data.Array


--assume that input array was sorted by assending

find::Array Int Int ->Int->(Int,Int)->Bool
find ar x (start,end)  =  let mid = div (start + end) 2 in
                          if (ar!mid ==x) || (ar!start ==x) || (ar!end ==x) then True else
                          if end - start <=1 then False else
                          if (ar!mid) > x then find ar x (start+1,mid-1) else
                          if (ar!mid) < x then find ar x (mid+1,end-1) else  False



--first
solver::Array Int Int -> [Int] -> Int
solver s t = sum (map (\ x -> if find s x (bounds s) then 1 else 0) t)

main::IO()
main = do
  nc<-getLine
  let n = read nc
  sc<-getLine
  let s = map read (words sc)::[Int]
  let s_arr = listArray (1,n) s
  _<-getLine
  tc<-getLine
  let t = map read (words tc)::[Int]
  print (solver s_arr t)