#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;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwppbnQgbWFpbigpIHsKCWxsIG4sIGFuc3dlcj0wOwoJY2luPj5uOwoJdmVjdG9yPGxsPiBBKG4pOwoJdmVjdG9yPGxsPiBCKG4pOwoJdW5vcmRlcmVkX21hcDxsbCwgbGw+IG1wQTsKCXVub3JkZXJlZF9tYXA8bGwsIGxsPiBtcEI7Cglmb3IobGwgaT0wO2k8bjtpKyspewoJCWNpbj4+QVtpXTsKCQltcEFbQVtpXV0rKzsKCX0KCWZvcihsbCBpPTA7aTxuO2krKyl7CgkJY2luPj5CW2ldOwoJCW1wQltCW2ldXSsrOwoJfQoJZm9yKGF1dG8gaXQ6bXBBKXsKCQlsbCBjb3VudD0wOwoJCWxsIGVsZW1lbnQ9aXQuZmlyc3Q7CgkJbGwgZnJlcUE9aXQuc2Vjb25kOwoJCWZvcihsbCBqPWVsZW1lbnQ7ajw9MTAwMDAwNTtqPWorZWxlbWVudCl7CgkJCWlmKG1wQi5maW5kKGopIT1tcEIuZW5kKCkpCgkJCQljb3VudD1jb3VudCttcEJbal07CgkJfQoJCWFuc3dlcj1hbnN3ZXIrY291bnQqZnJlcUE7Cgl9Cgljb3V0PDxhbnN3ZXI8PCJcbiI7CglyZXR1cm4gMDsKfQ==

MwoyIDMgNAo2IDEyIDE1

3
2 3 4
6 12 15