#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n; cin >> n;
  vector<ll> A(n);
  vector<ll> sum(n+1);
  vector<ll> mx(n+1);
  rep(i, n) {
    cin >> A[i];
    sum[i+1] = sum[i] + A[i];
    mx[i+1] = max(sum[i+1], mx[i]);
  }
  ll tmp = 0;
  ll ans = 0;
  rep(i, n) {
    chmax(ans, tmp+mx[i+1]);
    tmp += sum[i+1];
  }
  cout << ans << endk;
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    long long sum=0,sum2=0,maxx=0;
    for(int i=1;i<=n;i++)
    {
        long long x;
        cin >> x;
        sum+=x;
        sum2+=sum;
        maxx=max(maxx,x);
        cout << sum2+maxx*i << '\n';

    }
}
