#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int mxN = 200005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
ll niz[mxN];

ll pref[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n; ff(i,1,n)cin >> niz[i];

    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];

    ll tren = 0;
    ll mx = 0;
    ff(i,1,n){
        tren += pref[i];
        mx = max(mx, niz[i]);

        ll rez = tren + 1ll * i * mx;
        cout << rez << '\n';
    }

    return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

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

int main(){
    long long i,j,k,l,m,n,t;
    cin>>n;
    k=0;
    m=0;
    l=0;
    for(i=0;i<n;i++) {
        cin>>j;
        k+=j;
        l+=k;
        if (m<j) m=j;
        cout<<l+m*(i+1)<<' ';
    }
    return 0;
}