#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

void solve(){
    int n;
    cin >> n;
    vector<int>a(n + 1), b(n + 1);
    for (int i = 1;i <= n;i ++){
        cin >> a[i];
    }
    for (int i = 1;i <= n;i ++){
        cin >> b[i];
    }

    vector<vector<int>>adj(n + 1);
    vector<int>vis(n + 1);
    for (int i = 1;i <= n;i ++){
        if (vis[i]) continue;
        i64 j = 1;
        while (j * i <= n){
            j *= i;
            adj[i].push_back(j);
            vis[j] = 1;
            if (i == 1) break;
        }
    }

    i64 ans = 0;
    for (int i = 1;i <= n;i ++){
        if (adj[i].empty()) continue;
        int n = adj[i].size();
        i64 res = 0;
        for (int mask = 1;mask < (1 << n); mask ++){
            i64 score = 0;
            for (int j = 0;j < n;j ++){
                if (mask >> j & 1){
                    score += a[adj[i][j]];
                }
                for (int k = 0;k < j;k ++){
                    if (mask >> j & 1){
                        if ((j + 1) % (k + 1) == 0){
                            score -= b[adj[i][j]];
                        }
                    }
                }
            }
            res = max(res, score);
        }
        ans += res;
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    return 0;
}