#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
	ll n, answer=0;
	cin>>n;
	vector<ll> A(n);
	vector<ll> B(n);
	unordered_map<ll, ll> mpA;
	unordered_map<ll, ll> mpB;
	for(ll i=0;i<n;i++){
		cin>>A[i];
		mpA[A[i]]++;
	}
	for(ll i=0;i<n;i++){
		cin>>B[i];
		mpB[B[i]]++;
	}
	for(auto it:mpA){
		ll count=0;
		ll element=it.first;
		ll freqA=it.second;
		for(ll j=element;j<=1000005;j=j+element){
			if(mpB.find(j)!=mpB.end())
				count=count+mpB[j];
		}
		answer=answer+count*freqA;
	}
	cout<<answer<<"\n";
	return 0;
}