SPOJ in Gyumri

   Central bank of Flatland is planning to put n deposits to the market. Each deposit is characterized by its amount a_i.

   For example, if they already have prizes for 2, 3 and 9 dollars, and they want to buy 2 prizes, they should buy prizes for 1 and 7 dollars. Then the winner of the show would be able to collect prizes for any score from 1 to 22.

   The regulations of Flatland's market authorities require each deposit to be refinanced by equal integer amount each day. That means that a deposit with amount a and a request with length b match each other if and only if a is divisible by b.

   Given information about deposits and requests, find the number of deposit-request pairs that match each other.

   The first line of the input file contains n — the number of deposits. The second line contains n integer numbers: a₁, a₂, …, a_n. (1 ≤ n ≤ 100000, 1 ≤ a_i ≤ 10⁶)

   The third line of the input file contains m — the number of requests. The forth line contains m integer numbers: b₁, b₂, …, b_m. (1 ≤ m ≤ 100000, 1 ≤ b_i ≤ 10⁶)

   Output one number — the number of matching pairs.

   For sample test the following pairs match each other: (3, 1) twice (as (a₁, b₁) and as (a₁, b₂)), (3, 3), (4, 1) twice, (4, 2), (5, 1) twice, (6, 1) twice, (6, 2), and (6, 3).