## Problem D. Deposits ≡

 Author: ACM ICPC 2008-2009, NEERC, Northern Subregional Contest Time limit: 3 sec Input file: deposits.in Memory limit: 256 Mb Output file: deposits.out

### Statement

Financial crisis forced many central banks deposit large amounts of cash to accounts of investment and savings banks in order to provide liquidity and save credit markets.

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

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.

### Input file format

The first line of the input file contains n — the number of deposits. The second line contains n integer numbers: a1, a2, …, an.

The third line of the input file contains m — the number of requests. The forth line contains m integer numbers: b1, b2, …, bm.

### Output file format

Output one number — the number of matching pairs.

For sample test the following pairs match each other: (3, 1) twice (as (a1, b1) and as (a1, b2)), (3, 3), (4, 1) twice, (4, 2), (5, 1) twice, (6, 1) twice, (6, 2), and (6, 3).

### Constraints

1 ≤ n ≤ 100000, 1 ≤ ai ≤ 106,

1 ≤ m ≤ 100000, 1 ≤ bi ≤ 106.

### Sample tests

No. Input file (deposits.in) Output file (deposits.out)
1
4
3 4 5 6
4
1 1 2 3

12


0.037s 0.007s 15