題干：

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?ai?(0?<?a1?<?a2?<?...?<?an)?teeth, and the?j-th star on the rear wheel axle has?bj?(0?<?b1?<?b2?<?...?<?bm)?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?a1,?a2,?...,?an?(1?≤?ai?≤?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?b1,?b2,?...,?bm?(1?≤?bi?≤?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.

Output

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

Examples

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 them?a1?=?4,?b1?=?12, and for the other?a2?=?5,?b3?=?15.

題目大意：

? ?給兩組數(shù)a和b。 從兩組中各選一個數(shù)，求最大的整數(shù)比值有多少個。

解題報告：

? ?暴力就好了。、

AC代碼：

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define ll long long #define pb push_back #define pm make_pair #define fi first #define se second using namespace std; const int MAX = 2e5 + 5; ll a[505],b[505]; ll maxx,ans; int n,m; int main() {cin>>n;for(int i = 1; i<=n; i++) scanf("%lld",a+i);cin>>m;for(int i = 1; i<=m; i++) scanf("%lld",b+i);for(int i = 1; i<=n; i++) {for(int j = 1; j<=m; j++) {if(b[j]%a[i] == 0) maxx = max(maxx,b[j]/a[i]);}}for(int i = 1; i<=n; i++) {for(int j = 1; j<=m; j++) {if(b[j]%a[i] == 0 && b[j] / a[i] == maxx) ans++;}}printf("%lld\n",ans);return 0 ;}

?

總結(jié)

以上是生活随笔為你收集整理的【CodeForces - 215A】Bicycle Chain （水题）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。