#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
#define dump(x) cerr << #x " = " << x << endl
using namespace std;
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
template <class T, class U> inline void chmax(T & a, U const & b) { a = max<T>(a, b); }
template <class T, class U> inline void chmin(T & a, U const & b) { a = min<T>(a, b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }
template <typename T> ostream & operator << (ostream & out, vector<T> const & xs) { REP (i, (int)xs.size() - 1) out << xs[i] << ' '; if (not xs.empty()) out << xs.back(); return out; }

int64_t solve(int n, const vector<int> & a) {
    int64_t answer = INT64_MIN;
    REP3 (k, 1, n + 1) {
        // list groups
        vector<int> lower;
        auto b = a;
        for (int l = 0; l + k <= n ; l += k) {
            sort(b.begin() + l, b.begin() + (l + k));
            lower.push_back(b[l + (k - 1) / 2]);
        }
        vector<int> upper;
        b = a;
        for (int r = n; r - k >= 0 ; r -= k) {
            sort(b.begin() + (r - k), b.begin() + r);
            upper.push_back(b[(r - k) + (k - 1) / 2]);
        }

        // make cumulative sums
        vector<int64_t> l(lower.size() + 1);
        int64_t sum_lower = 0;
        REP (i, lower.size()) {
            sum_lower += lower[i];
            l[i + 1] = max(l[i], sum_lower);
        }
        vector<int64_t> r(upper.size() + 1);
        int64_t sum_upper = 0;
        REP (i, upper.size()) {
            sum_upper += upper[i];
            r[i + 1] = max(r[i], sum_upper);
        }

        // make results
        REP (i, l.size()) {
            int j = r.size() - i - 1;
            chmax(answer, k * (l[i] + r[j]));
        }
    }
    return answer;
}

int main() {
    int n; cin >> n;
    vector<int> a(n);
    REP (i, n) {
        cin >> a[i];
    }
    cout << solve(n, a) << endl;
    return 0;
}