// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const ll inf = 5e15;
const size_t size = 1e4 + 10;
ll left_max[size], right_max[size];

VV<PLL> calc(const V<ll> &B) {
    ll N = B.size();
    VV<PLL> clis(N);
    for(ll i = 0; i < N; i++) {
        priority_queue<ll> min_pq;
        priority_queue<ll, V<ll>, greater<ll>> max_pq;  // poped from min_value to max_value
        min_pq.push(-inf);
        max_pq.push(inf);
        for(ll j = 0; i + j < N; j++) {
            ll pre = i;
            ll num = j + 1;
            if(i && pre < j) break;
            {
                ll e = B[i + j];
                ll tmp;
                if((max_pq.size() + min_pq.size()) % 2 == 0) {
                    tmp = max_pq.top();
                    max_pq.pop();
                } else {
                    tmp = min_pq.top();
                    min_pq.pop();
                }
                DEBUG(tmp);
                max_pq.push(max(tmp, e));
                min_pq.push(min(tmp, e));
                DEBUG(make_tuple(max_pq.size(),min_pq.size()));
            }
            if(pre % num) continue;
//            DEBUG(max_pq.size());
//            DEBUG(make_tuple(i, clis.size(), num, max_pq.top()));
            clis[i].emplace_back(num, min_pq.top());
        }
    }
    return clis;
}

int main() {
    ll N;
    cin >> N;
    V<ll> B(N);
    for(auto &&ele : B) cin >> ele;

    auto from_left = calc(B);
    reverse(ALL(B));
    auto from_right = calc(B);
    reverse(ALL(B));
return 0;
    ll ans = 0;
    for(ll K = 1; K <= N; K++) {
        {
            left_max[0] = 0;
            ll cur = 0;
            for(ll i = 1; i * K < N; i++) {
                ll from = (i - 1) * K;
                auto ite = lower_bound(ALL(from_left[from]), PLL(K, -inf));
                cur += ite->second;
                left_max[i] = max(left_max[i - 1], cur);
            }
        }
        {
            right_max[0] = 0;
            ll cur = 0;
            for(ll i = 1; i * K < N; i++) {
                ll from = (i - 1) * K;
                auto ite = lower_bound(ALL(from_right[from]), PLL(K, -inf));
                cur += ite->second;
                right_max[i] = max(right_max[i - 1], cur);
            }
        }

        for(ll left = 0; left * K <= N; left++) {
            ll rest = N - left * K;
            ll tmp = left_max[left] + right_max[rest / K];
            DEBUG(make_tuple(K, left, rest, left_max[left], right_max[rest/K], tmp * K));
            chmax(ans, tmp * K);
        }
    }
    cout << ans << endl;
    return 0;
}