#include<bits/stdc++.h>
#define pb push_back
#define endl ("\n")
#define mp make_pair
#define lb lower_bound
#define ff first
#define inf 1e18
#define ss second
#define cn continue
#define br break
#define ins insert
#define int long long
#define bit(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define up upper_bound
#define read(a,n) rep(i,0,n){cin>>a[i];}
#define print(a,n) rep(i,0,n) cout<<a[i]<<" ";
#define yy cout<<"Yes"<<endl;
#define nn cout<<"No"<<endl;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define mod 1000000007
using namespace std;




int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = clock();
    int t = 1 ;
    //cin >> t ;
    while (t--)
    {
        int n, a, b, c;
        cin >> c;
        a = (1.08) * c;
        n = 206;
        if (a < n)
        {
            cout << "Yay!";
        }
        else if (a == n)
        {
            cout << "so-so";
        }
        else
        {
            cout << ":(";
        }

    }
    cerr << "\nTIME: " << (long double)(clock() - T) / CLOCKS_PER_SEC << " sec\n";
    T = clock();
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
  long long n,m=0;
  cin >> n;
  vector<long long> A,M;
  for(int i=0;i<n;i++){
    long long a;
    cin>>a;
    A.push_back(a);
    m=max(m,a);
    M.push_back(m);
  }
  vector<long long>B,C;
  B.push_back(A[0]);
  C.push_back(B[0]);
  for(int i=1;i<n;i++){
    B.push_back(B[i-1]+A[i]);
    C.push_back(C[i-1]+B[i]);
  }

  for(int k=0; k<n; k++)
    cout << C[k]+M[k]*(k+1LL) << "\n";
  return 0;
}