#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long LL;

LL getMedian(vector<LL>& a, LL begin, LL end){
    sort(a.begin() + begin, a.begin() + end);
    return *(a.begin() + (begin + end - 1) / 2);
}

void build(vector<LL>& a, LL n, LL k, vector<LL>& left, vector<LL>& left_cum){
    for(LL i = 0; (i+1)*k <= n; ++i){
        left[i] = getMedian(a, i*k, (i+1)*k);
    }
    LL cur = 0;
    for(LL i = 0; i < left.size(); ++i){
        cur += left[i];
        left_cum[i+1] = max(cur, left_cum[i]);
    }
}

LL solve(vector<LL> a, LL n, LL k){
    vector<LL> b = a;
    reverse(b.begin(), b.end());
    vector<LL> left(n / k);
    vector<LL> right(n / k);
    vector<LL> left_cum(n / k + 1);
    vector<LL> right_cum(n / k + 1);
    build(a, n, k, left, left_cum);
    build(b, n, k, right, right_cum);
    LL ans = 0;
    for(LL i = 0; i < left_cum.size(); ++i){
        ans = max(ans, left_cum[i] + right_cum[right_cum.size()-1-i]);
    }
    /*
    cerr << "k=" << k << endl;
    for(LL i = 0; i < left_cum.size(); ++i){
        cerr << "left " << left_cum[i] << endl;
    }
    for(LL i = 0; i < left_cum.size(); ++i){
        cerr << "right " << right_cum[i] << endl;
    }
    cerr << "best=" << ans * k << endl;
    */
    return ans * k;
}


int main(){
    LL N;
    cin >> N;
    vector<LL> a(N);
    for(LL i = 0; i < N; ++i){
        cin >> a[i];
    }
    LL ans = 0;
    for(LL k = 1; k <= N; ++k){
        ans = max(ans, solve(a, N, k));
    }
    cout << ans << endl;
}