a=int(input())
b=map(int,input().split())
x=list(b)
c=int(input())
d=map(int,input().split())
y=list(d)
bos=[]
for i in range(len(y)):
for k in range(len(x)):
if y[i]%(x[k])==0:
bos.append(y[i]/(x[k]))
print(bos.count(max(bos)))#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define vii vector<pair<int,int>>
#define ll long long
#define ff first
#define ss second
#define rep(i,a,b) for(int i=a;i<b;i++)
#define pq priority_queue
#define MAXN 100001
int main()
{
int n,m;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
cin>>m;
int b[m];
for(int i=0;i<m;i++)
cin>>b[i];
int gearRatio=INT_MIN;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(b[j]%a[i]==0)
{
gearRatio=max(b[j]/a[i] , gearRatio);
}
}
}
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(b[j]%a[i]==0)
{
if(b[j]/a[i]==gearRatio)
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
1629D - Peculiar Movie Preferences | 1629E - Grid Xor |
1629F1 - Game on Sum (Easy Version) | 2148. Count Elements With Strictly Smaller and Greater Elements |
2149. Rearrange Array Elements by Sign | 2150. Find All Lonely Numbers in the Array |
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |
977A - Wrong Subtraction | 263A - Beautiful Matrix |
180C - Letter | 151A - Soft Drinking |
1352A - Sum of Round Numbers | 281A - Word Capitalization |
1646A - Square Counting | 266A - Stones on the Table |
61A - Ultra-Fast Mathematician | 148A - Insomnia cure |
1650A - Deletions of Two Adjacent Letters | 1512A - Spy Detected |