#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
template<typename T>
struct convex_hull_trick{
private:
  struct node{
    node *left,*right;
    static const T inf=numeric_limits<T>::max();
    T a,b;
    node():node(0,inf){}
    node(const T a,const T b):left(nullptr),right(nullptr),a(a),b(b){}
    T f(const T x)const{return a*x+b;}
  };
  static void swap(node *x,node *y){
    std::swap(x->a,y->a),std::swap(x->b,y->b);
  }
  void add(node *cu,node *nw,T l,T r){
    while(true){
      if(nw->f(l)<cu->f(l))swap(cu,nw);
      if(cu->f(r-1)<=nw->f(r-1))return;
      T mid=(l+r)/2;
      if(cu->f(mid)<=nw->f(mid)){
        if(!cu->right){
          cu->right=new node(*nw);
          return;
        }
        else{
          cu=cu->right,l=mid;
        }
      }
      else{
        swap(cu,nw);
        if(!cu->left){
          cu->left=new node(*nw);
          return;
        }
        else{
          cu=cu->left,r=mid;
        }
      }
    }
  }
  T query(node *cu,T k,T l,T r)const{
    T ans=numeric_limits<T>::max();
    while(cu){
      chmin(ans,cu->f(k));
      T mid=(l+r)/2;
      if(k<mid){
        cu=cu->left,r=mid;
      }
      else{
        cu=cu->right,l=mid;
      }
    }
    return ans;
  }
  void clear(node *cu){
    if(cu->left)clear(cu->left);
    if(cu->right)clear(cu->right);
    delete cu;
  }
  const T l,r;
  node *root;
public:
  convex_hull_trick(const T l,const T r):l(l),r(r),root(new node()){
    assert(l<r);
  }
  //y=a*x+b
  void add(const T a,const T b){
    node nw(a,b);
    return add(root,&nw,l,r);
  }
  T query(const T k)const{
    return query(root,k,l,r);
  }
};
struct S{
  vector<ll>dat;
  int b2;
  S(ll x){
    b2=1;
    while(b2<x)b2<<=1;
    dat.resize(b2*2,1e18);
  }
  void a(int l,int r,ll v){
    l+=b2,r+=b2;
    while(l<r){
      if(l&1)chmin(dat[l++],v);
      if(r&1)chmin(dat[--r],v);
      l>>=1,r>>=1;
    }
  }
  ll b(int i){
    ll ret=1e18;
    i+=b2;
    while(i){
      chmin(ret,dat[i]);
      i>>=1;
    }
    return ret;
  }
};
void SOLVE(){
  int n;
  cin>>n;
  vector<ll>a(n);
  cin>>a;
  vector<ll>ra(a);
  ra.push_back(0);
  for(int i=n-1;i>=0;i--)ra[i]+=ra[i+1];
  S seg(n);
  auto dfs=[&](auto self,int l,int r)->void {
    if(l+1==r){
      seg.a(l,l+1,1+a[l]);
      return;
    }
    if(l+2==r){
      seg.a(l,l+2,4+a[l]+a[l+1]);
      seg.a(l,l+1,1+a[l]);
      seg.a(l+1,l+2,1+a[l+1]);
      return;
    }
    int mid=(l+r)/2;
    self(self,l,mid);
    self(self,mid+1,r);
    {
      convex_hull_trick<ll>cht(-1e9,1e9);
      reps(k,mid+1,r+1)cht.add(-2*k,ll(k)*k-ra[k]);
      reps(i,l,mid+1){
        ll now=cht.query(i)+ll(i)*i+ra[i];
        debug(i,mid+1,now);
        seg.a(i,mid+1,now);
      }
    }
    {
      convex_hull_trick<ll>cht(-1e9,1e9);
      reps(k,l,mid+1)cht.add(-2*k,ll(k)*k+ra[k]);
      reps(i,mid+1,r+1){
        ll now=cht.query(i)+ll(i)*i-ra[i];
        debug(mid,i,now);
        seg.a(mid,i,now);
      }
    }
  };
  dfs(dfs,0,n);
  //l<=i<mid
  //mid<=x<r
  //min(sum[i]-sum[x]+(x-i)^2)
  //min(sum[i]-sum[x]+x^2-2xi+i^2)
  rep(i,n)cout<<seg.b(i)<<endl;
}