#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
int n,a[N],b[N],fa[N],siz[N],mk[N],res;
vector<int>g[N];
int f(int x){
	if(x==fa[x])return x;
	return fa[x]=f(fa[x]);
}
vector<int>p[N];
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)cin>>b[i];
    for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=2;i<=n;i++){
		for(int j=i*i;j<=n;j*=i){
			p[j].push_back(i);
			fa[f(i)]=f(j);
		}
	}
	for(int i=1;i<=n;i++)g[f(i)].push_back(i);
	for(int i=1;i<=n;i++){
		int ans=0;
		for(int j=0;j<(1<<g[i].size());j++){
			int rr=0;
			for(auto c:g[i])mk[c]=0;
			for(int k=0;k<g[i].size();k++){
				if(j>>k&1^1)continue;
				mk[g[i][k]]=1;
				rr+=a[g[i][k]];
			}
			for(int k=0;k<g[i].size();k++){
				if(j>>k&1^1)continue;
				int c=g[i][k];
				if(c==1)continue;
				for(int l=c*c;l<=n;l*=c)if(mk[l])rr-=b[l];
			}
			ans=max(ans,rr);
		}
		res+=ans;
	}
	cout<<res;
}