A. Bicycle Chain

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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₁ < a₂ < ... < a_n) teeth, and the j-th star on the rear wheel axle has b_j (0 < b₁ < b₂ < ... < 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.

Input

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₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁴) 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 mintegers b₁, b₂, ..., b_m (1 ≤ b_i ≤ 10⁴) 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.

Output

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

Sample test(s)

input

2
4 5
3
12 13 15

output

2

input

4
1 2 3 4
5
10 11 12 13 14

output

1

Note

In the first sample the maximum "integer" gear ratio equals 3. There are two gears that have such gear ratio. For one of thema₁ = 4, b₁ = 12, and for the other a₂ = 5, b₃ = 15.

解题说明：此题就是求出最大整数比的个数

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

int main()
{
	int i,n,m,j;
	int a[51],b[51];
	int max;
	int temp;
	int count;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	scanf("%d",&m);
	for(j=0;j<m;j++)
	{
		scanf("%d",&b[j]);
	}
	max=0;
	count=0;
	for(j=0;j<m;j++)
	{
		for(i=0;i<n;i++)
		{
			if(b[j]%a[i]==0)
			{
				temp=b[j]/a[i];
				if(max<temp)
				{
					max=temp;
					count=1;
				}
				else if(max==temp)
				{
					count++;
				}
			}
		}
	}

	printf("%d\n",count);
	

	return 0;
}