#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N = 2e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

const double PI = acos(-);

int n, que[N], be = , ed = ;

LL val[N], a[N], sum[N], ans;

long double calc(int k, int j) {

    return ((a[j] - (long double)j * sum[j]) - (a[k] - (long double)k * sum[k])) / (j - k);

}

int main() {

    scanf("%d", &n);

    for(int i = ; i <= n; i++) {

        scanf("%lld", &val[i]);

        a[i] = a[i - ] + i * val[i];

        sum[i] = sum[i - ] + val[i];

        ans = max(ans, a[i]);

    }

    que[++ed] = ;

    for(int i = ; i <= n; i++) {

        int low = be, high = ed - , p = -;

        while(low <= high) {

            int mid = low + high >> ;

            if(calc(que[mid], que[mid + ]) < -sum[i]) p = mid, low = mid + ;

            else high = mid - ;

        }

        int j = (p == -) ? que[be] : que[p + ];

        ans = max(ans, a[i] -a[j] - j * (sum[i] - sum[j]));

        while(ed > be && calc(que[ed-], que[ed]) > calc(que[ed], i)) ed--;

        que[++ed] = i;

    }

    printf("%lld\n", ans);

    return ;

}

/*

*/