#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
vector<Int> A, B;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N + 1); for (int i = 1; i <= N; ++i) scanf("%lld", &A[i]);
    B.resize(N + 1); for (int i = 1; i <= N; ++i) scanf("%lld", &B[i]);
    
    Int ans = A[1];
    vector<int> vis(N + 1, 0);
    for (int i = 2; i <= N; ++i) if (!vis[i]) {
      vector<int> is{1, i};
      for (int j = i; j <= N / i; ) {
        j *= i;
        is.push_back(j);
      }
      const int isLen = is.size();
// cerr<<"is = "<<is<<endl;
      for (const int j : is) {
        vis[j] = 1;
      }
      Int mx = 0;
      for (int p = 0; p < 1 << isLen; p += 2) {
        int bad = 0;
        for (int k = 1; k < isLen; ++k) if (p >> k & 1) {
          for (int l = 2 * k; l < isLen; l += k) {
            bad |= 1 << l;
          }
        }
        Int score = 0;
        for (int k = 1; k < isLen; ++k) if (p >> k & 1) {
          score += A[is[k]];
          if (bad >> k & 1) {
            score -= B[is[k]];
          }
        }
        chmax(mx, score);
      }
      ans += mx;
    }
    printf("%lld\n", ans);
  }
  return 0;
}