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

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))

using uint=unsigned;
using ull=unsigned long long;

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

int fdiv(int a,int b){
	return a/b-((a^b)<0&&a%b);
}

struct CHT{
	struct ln{
		int a,b;
		int eval(int x){return a*x+b;}
	};
	int pos(ln x,ln y){
		return fdiv(x.b-y.b,y.a-x.a);
	}
	vc<ln> ls;
	//a nonincreasing
	void add(int a,int b){
		if(ls.size()&&ls.back().a==a){
			chmin(b,ls.back().b);
			ls.pop_back();
		}
		int s;
		while((s=ls.size())>=2){
			int x=pos(ls[s-2],ls[s-1]);
			int y=pos(ls[s-1],ln{a,b});
			if(x<y)break;
			ls.pop_back();
		}
		ls.pb(ln{a,b});
	}
	//x nonincreasing
	//return min
	int query(int x){
		if(ls.empty())return inf;
		int s;
		while((s=ls.size())>=2)
			if(ls[s-2].eval(x)>ls[s-1].eval(x))
				break;
			else
				ls.pop_back();
		return ls.back().eval(x);
	}
};

vi slv(vi a){
	int n=a.size();
	if(n==1){
		return vi{1+a[0]};
	}
	int m=n/2;
	vi l(m),r(n-m);
	rep(i,m)
		l[i]=a[i];
	rep(i,n-m)
		r[i]=a[i+m];
	vi x=slv(l),y=slv(r);
	rep(k,2){
		CHT cht;
		{
			int s=accumulate(all(l),int(0));
			rep(i,m+1){
				cht.add(-2*i,s+i*i);
				if(i<m)
					s-=l[i];
			}
		}
		int s=accumulate(all(r),int(0));
		int cur=inf;
		per(i,n-m){
			int w=m+i+1;
			chmin(cur,cht.query(w)+s+w*w);
			chmin(y[i],cur);
			s-=r[i];
		}
		
		reverse(all(l));
		reverse(all(r));
		swap(l,r);
		reverse(all(x));
		reverse(all(y));
		swap(x,y);
		m=n-m;
	}
	x.insert(x.ed,all(y));
	return x;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int n;cin>>n;
	vi a=readvi(n);
	vi ans=slv(a);
	for(auto v:ans)
		print(v);
}