#include <iostream>
#include<bits/stdc++.h>


using namespace std;

typedef long long int ll;


int main() {
	ll n;
	cin>>n;
	vector<ll> a(n+1);
	vector<ll> b(n+1);
	
	unordered_map<ll,ll> mpp_1;
	unordered_map<ll,ll> mpp_2;
	
	
	for(ll i=1;i<=n;i++){
		cin>> a[i];
		mpp_1[a[i]]++;
	}
	
	for(int i=1;i<=n;i++){
		cin>>b[i];
		mpp_2[b[i]]++;
		
	}
	ll ans = 0;
	
	for(auto it : mpp_1){
		ll count = 0;
	    ll num = it.first;
	    for(int i=num ; i<=1000000 ;i = i+num){
	    	
	    	if(mpp_2.find(i)!=mpp_2.end()){
	    	count = count + mpp_2[i];
	    	}
	    }
	    count = count*it.second;
	    ans=ans+count;
	    
		
	}
	
	cout<<ans;
	
	
	
	
	
	
	return 0;
}