#include <bits/stdc++.h>
using namespace std;

template<typename T>
struct BIT {
    int n;
    vector<T> dat;
 
    BIT(int n=0){
        initialize(n);
    }
 
    void initialize(int nin){
        n = nin;
        dat.resize(n, 0);
    }
 
    T sum(int i){
        T s = 0;
        while(i >= 0){
            s += dat[i];
            i = (i & (i+1)) - 1;
        }
        return s;
    }
 
    T sum_between(int i, int j){
        return sum(j) - sum(i-1);
    }
 
    void plus(int i, T x){
        while(i < n){
            dat[i] += x;
            i |= i+1;
        }
    }
};

template<typename T>
struct BIT2D {
    int n;
    vector<BIT<T>> dat;
 
    BIT2D(int nin, int min){
        n = nin;
        dat.resize(n, 0);
        for(int i=0; i<n; i++) dat[i] = BIT<T>(min);
    }
 
    T sum(int i, int js, int jt){
        T s = 0;
        while(i >= 0){
            s += dat[i].sum_between(js, jt);
            i = (i & (i+1)) - 1;
        }
        return s;
    }
 
    T sum_between(int is, int it, int js, int jt){
        return sum(it, js, jt) - sum(is-1, js, jt);
    }
 
    void plus(int i, int j, T x){
        while(i < n){
            dat[i].plus(j, x);
            i |= i+1;
        }
    }

    int lower_bound(int l, int r, T x){
        int ret = -1;
        int k = 1;
        while(2*k <= n) k <<= 1;
        for( ;k>0; k>>=1){
            if(ret+k < n){
                T v = dat[ret+k].sum_between(l, r);
                if(v < x){
                    x -= v;
                    ret += k;
                }
            }
        }
        return ret + 1;
    }
};

void chmax(int64_t& a, int64_t b){
    a = max(a, b);
}

int main(){
    int N, A[10000];
    cin >> N;
    map<int, int> mp;
    for(int i=0; i<N; i++){
        cin >> A[i];
        mp[A[i]] = 0;
    }
    int sz = 0;
    vector<int> cmp;
    for(auto p : mp){
        mp[p.first] = sz++;
        cmp.push_back(p.first);
    }
    
    BIT2D<int> bit(sz, N);
    for(int i=0; i<N; i++) bit.plus(mp[A[i]], i, 1);

    int64_t ans = 0;
    for(int k=1; k<=N; k++){
        int lim = N/k;
        vector<int64_t> ls(lim+1), rs(lim+1);
        for(int i=0; i<lim; i++){
            int s = i*k;
            int t = s+k-1;
            int m = bit.lower_bound(s, t, (k+1)/2);
            ls[i+1] = cmp[m] + ls[i];
        }
        for(int i=0; i<lim; i++){
            int t = N-1-i*k;
            int s = t-k+1;
            int m = bit.lower_bound(s, t, (k+1)/2);
            rs[i+1] = cmp[m] + rs[i];
        }
        for(int i=0; i<lim; i++){
            chmax(ls[i+1], ls[i]);
            chmax(rs[i+1], rs[i]);
        }
        int64_t mx = 0;
        for(int i=0; i<=lim; i++) chmax(mx, ls[i] + rs[lim-i]);
        chmax(ans, mx*k);
    }
    cout << ans << endl;
    return 0;
}