CF215A.Bicycle Chain

Vasya's bicycle chain drive consists of two parts: n stars are attached to the pedal axle, m stars are attached to the rear wheel axle. The chain helps to rotate the rear wheel by transmitting the pedal rotation.

We know that the i-th star on the pedal axle has a__i (0 < _a_1 < _a_2 < ... < a__n) teeth, and the j-th star on the rear wheel axle has b__j (0 < _b_1 < _b_2 < ... < b__m) teeth. Any pair (i, j) (1 ≤ i ≤ n; 1 ≤ j ≤ m) is called a gear and sets the indexes of stars to which the chain is currently attached. Gear (i, j) has a gear ratio, equal to the value .

Since Vasya likes integers, he wants to find such gears (i, j), that their ratios are integers. On the other hand, Vasya likes fast driving, so among all "integer" gears (i, j) he wants to choose a gear with the maximum ratio. Help him to find the number of such gears.

In the problem, fraction denotes division in real numbers, that is, no rounding is performed.

瓦西娅的自行车链条传动系统由两部分组成：踏板轴上安装有 $n$ 个链轮，后轮轴上安装有 $m$ 个链轮。链条通过传递踏板的旋转来驱动后轮转动。

已知踏板轴上的第 $i$ 个链轮有 $a_i$（满足 $0 < a_1 < a_2 < \dots < a_n$）个齿，后轮轴上的第 $j$ 个链轮有 $b_j$（满足 $0 < b_1 < b_2 < \dots < b_m$）个齿。任意一对 $(i,\,j)$（其中 $1 \le i \le n$，$1 \le j \le m$）称为一个“档位”，表示链条当前所连接的两个链轮的编号。档位 $(i,\,j)$ 的传动比等于值 。

由于瓦西娅偏爱整数，他希望找出所有满足传动比为整数的档位 $(i,\,j)$。另一方面，瓦西娅也喜欢高速骑行，因此在所有这些“整数传动比”的档位 $(i,\,j)$ 中，他希望选出传动比最大的那个。请帮助他找出满足该最大传动比的档位的数量。

本题中，分数 表示实数除法，即不进行任何舍入操作。

The first input line contains integer n (1 ≤ n ≤ 50) — the number of stars on the bicycle's pedal axle. The second line contains n integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 104) in the order of strict increasing.

The third input line contains integer m (1 ≤ m ≤ 50) — the number of stars on the rear wheel axle. The fourth line contains m integers _b_1, _b_2, ..., b__m (1 ≤ b__i ≤ 104) in the order of strict increasing.

It is guaranteed that there exists at least one gear (i, j), that its gear ratio is an integer. The numbers on the lines are separated by spaces.

第一行输入包含一个整数 $n$（$1 \leq n \leq 50$）——表示自行车曲柄轴上的飞轮齿数。
第二行输入包含 $n$ 个整数 $a_1,\,a_2,\,\dots,\,a_n$（$1 \leq a_i \leq 10^4$），按严格递增顺序给出。

第三行输入包含一个整数 $m$（$1 \leq m \leq 50$）——表示后轮轴上的飞轮齿数。
第四行输入包含 $m$ 个整数 $b_1,\,b_2,\,\dots,\,b_m$（$1 \leq b_i \leq 10^4$），按严格递增顺序给出。

保证至少存在一对齿轮 $(i,\,j)$，其传动比为整数。每行中的数字以空格分隔。

Print the number of "integer" gears with the maximum ratio among all "integer" gears.

输出所有“整数”齿轮中，具有最大传动比的“整数”齿轮的数量。

In the first sample the maximum "integer" gear ratio equals 3. There are two gears that have such gear ratio. For one of them _a_1 = 4, _b_1 = 12, and for the other _a_2 = 5, _b_3 = 15.

在第一个样例中，最大的“整数”传动比为 3。有两个齿轮组具有该传动比：其中一组 $a_1 = 4,\ b_1 = 12$，另一组 $a_2 = 5,\ b_3 = 15$。