#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)

using namespace std;

using ll = long long;
void chmin(ll& a, ll b) { if (a > b) a = b; }

class SparseTable {
private:
    int n, lg;
    vector<vector<ll>> dat;

public:
    SparseTable(int n_) : n(n_) {
        lg = 0;
        while ((1 << lg) < n) ++lg;
        dat.assign(lg + 1, vector<ll>(n, 1e18));
    }
    void set(int k, ll x) {
        dat[0][k] = x;
        rep (i, lg) {
            if (k + (1 << i) >= n) break;
            dat[i + 1][k] = min(dat[i][k], dat[i][k + (1 << i)]);
        }
    }
    ll get(int k) {
        return dat[0][k];
    }
    ll prod(int l, int r) {
        if (l >= r) return 1e18;
        int h = __lg(r - l);
        return min(dat[h][l], dat[h][r - (1 << h)]);
    }
};

int main() {
    int N; cin >> N;
    vector<int> A(N);
    rep (i, N) cin >> A[i];

    const int M = A[N - 1];

    vector<int> idx(M + 1, N);
    rep (i, N) idx[A[i]] = i;
    rrep (i, M + 1) {
        if (idx[i] == N) idx[i] = idx[i + 1];
    }

    SparseTable seg(N);
    seg.set(N - 1, 0);
    rrep (i, N - 1) {
        int j = i + 1;
        ll mn = 1e18;
        while (j != N) {
            int p = A[j] / A[i];
            int k = (p + 1) * A[i] > M ? N : idx[(p + 1) * A[i]];
            chmin(mn, seg.prod(j, k) + p * A[i]);
            j = k;
        }
        seg.set(i, mn);
    }

    ll sm = 0;
    rep (i, N) sm += A[i];
    cout << sm - seg.get(0) << endl;
}