#include<bits/stdc++.h>
using namespace std;
const int M = 1000000007;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<vector<int>> mid(n + 1);
    for (int i = 1; i <= n; ++i) {
        mid[i] = vector<int>(i);
    }
    for (int i = 0; i < n; ++i) {
        priority_queue<int> lq;
        priority_queue<int, vector<int>, greater<int>> uq;
        lq.push(-M);
        uq.push(M);
        for (int j = i; j < n; ++j) {
            if (uq.top() > a[j]) {
                lq.push(a[j]);
            }
            else {
                uq.push(a[j]);
            }
            while (uq.size() > lq.size()) {
                lq.push(uq.top());
                uq.pop();
            }
            while (lq.size() > uq.size() + 1) {
                uq.push(lq.top());
                lq.pop();
            }
            mid[j + 1][i] = lq.top();
        }
    }
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
        vector<long long> sl(n / i + 1), sr(n / i + 1);
        vector<long long> ml(n / i + 1), mr(n / i + 1);
        for (int j = 0; j < n / i; ++j) {
            sl[j + 1] = sl[j] + mid[(j + 1) * i][j * i] * (long long)i;
            ml[j + 1] = max(ml[j], sl[j + 1]);
        }
        for (int j = 0; j < n / i; ++j) {
            sr[j + 1] = sr[j] + mid[n - j * i][n - (j + 1) * i] * (long long)i;
            mr[j + 1] = max(mr[j], sr[j + 1]);
        }
        for (int j = 0; j < n / i; ++j) {
            ans = max(ans, ml[j] + mr[n / i - j]);
        }
    }
    cout << ans << '\n';

    return 0;
}