#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

template<class A> string to_string(A v) {
	string res = "{";
	for (const auto &x: v) res += to_string(x) + ", ";
	return res.substr(0, res.size() - 2) + "}";
}
void debug_out() { cerr << "\n"; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h); debug_out(t...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "] : "; debug_out(__VA_ARGS__)
#define Time_Start clock_t start = clock()
#define Time_End  clock_t end = clock();\
        double time_elapsed = (double)(end - start) / CLOCKS_PER_SEC;\
        cerr << "time elapsed :" << time_elapsed << "s\n"


const int N = 1E5;
vector<int> pre[N + 10];
bool vis[N + 10];
int cnt[N + 10];
int a[N + 10], b[N + 10];
int n;

i64 cal(const vector<int>& link){
    int m = link.size();
    i64 cnt = 0;
    for (int i = 0; i < (1 << m); i++) {
        i64 res = 0;
        // debug(i);
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) res += a[link[j]];
            for (int k = 0; k < j; k ++){
                if (not (i & (1 << k)))  continue;
                if ((j + 1) % (k + 1) == 0) res -= b[link[j]];
            }
        }
        // debug(res);
        cnt = max(cnt, res);
    }
    return cnt;
}

void solve() { 
    cin >> n;
    for (int i = 2; i <= n; i++) {
        if(vis[i]) continue;
        for (i64 j = i; j <= n; j *= i) {
            pre[i].push_back(j);
            vis[j] = true;
        }
    }
    
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    
    i64 ans = a[1];
    for (int i = 2; i <= n; i++) {
        if(pre[i].empty()) continue;
        ans += cal(pre[i]);
        // debug(i, cal(pre[2]), pre[2]);
    }
    cout << ans << '\n';
} 


signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    Time_Start;



    int T; T = 1;
    // cin >> T; 
    while (T--) solve();

    Time_End;
    return 0;
}