//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>
  
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 100;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-12;
const double pi = atan2(0, -1);
const int ABC = 26;

ll a[N + 1];
bool need[N + 1];
ll ans = -big;

void rec(int mask, int cur_b) {
    if (cur_b == 26) {
        fill(need + 1, need + 100 + 1, true);
        rep(i, 1, 25 + 1) {
            if ((mask >> i) & 1) {
                for (int j = i; j <= 100; j += i) {
                    need[j] = false;
                }
            }
        }
        ll cur = 0;
        rep(i, 1, 25 + 1) {
            if (need[i]) {
                cur += a[i];
            }
        }
        rep(i, 26, 33 + 1) {
            if (i % 2 == 1) {
                ll best = 0;
                setmax(best, need[i] * a[i] + max(0LL, need[i * 2] * a[i * 2]) + max(0LL, need[i * 3] * a[i * 3]));
                need[i] = need[i * 2] = need[i * 3] = false;
                cur += best;
            } else {
                ll best = max(0LL, need[i * 3 / 2] * a[i * 3 / 2]);
                setmax(best, need[i] * a[i] + max(0LL, need[i * 2] * a[i * 2]) + need[i * 3] * a[i * 3] + need[i * 3 / 2] * a[i * 3 / 2]);
                setmax(best, need[i] * a[i] + max(0LL, need[i * 2] * a[i * 2]) + max(0LL, need[i * 3 / 2] * a[i * 3 / 2]));
                need[i] = need[i * 2] = need[i * 3] = need[i * 3 / 2] = false;
                cur += best;
            }
        }
        rep(i, 34, 50 + 1) {
            ll best = max(0LL, need[i] * a[i] + max(0LL, need[i * 2] * a[i * 2]));
            need[i] = need[i * 2] = false;
            cur += best;
        }
        rep(i, 51, 100 + 1) {
            if (need[i]) {
                cur += max(0LL, a[i]);
            }
        }
        setmax(ans, cur);
        return;
    }
    if ((mask >> cur_b) & 1) {
        rec(mask, cur_b + 1);
    } else {
        rec(mask, cur_b + 1);
        for (int y = cur_b; y <= 25; y += cur_b) {
            mask |= (1 << y);
        }
        rec(mask, cur_b + 1);
    }
}

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n;
    cin >> n;
    fill(a + 1, a + 100 + 1, 0);
    rep(i, 1, n + 1) {
        cin >> a[i];
    }
    rec(0, 1);
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 384