import sys
input = sys.stdin.readline
from collections import *

class CHT:
    def __init__(self):
        self.deq = deque()
        
    def check(self, f1, f2, f3):
        return (f2[0] - f1[0]) * (f3[1] - f2[1]) >= (f2[1] - f1[1]) * (f3[0] - f2[0])
    
    def f(self, f1, x):
        return f1[0]*x + f1[1]
    
    # add f_i(x) = a*x + b
    def add_line(self, a, b):
        f1 = (a, b)
        while len(self.deq) >= 2 and self.check(self.deq[-2], self.deq[-1], f1):
            self.deq.pop()
        self.deq.append(f1)
    
    # min f_i(x)
    def get(self, x):
        while len(self.deq) >= 2 and self.f(self.deq[0], x) >= self.f(self.deq[1], x):
            self.deq.popleft()
        return self.f(self.deq[0], x)

def dfs(l, r): # [l, r)
    global ans
    
    if r-l==1:
        ans[l] = min(ans[l], 1+A[l])
        return

    m = (l+r)//2
    # [l, m)
    if l<m:
        cht = CHT()
        
        for i in range(m+1, r+1):
            cht.add_line(-2*i, i*i+acc[i])
        
        res = 10**18
        
        for i in range(l, m):
            res = min(res, cht.get(i)+i*i-acc[i])
            ans[i] = min(ans[i], res)
    
    # [m, r)
    if m<r:
        cht = CHT()
        
        for i in range(l, m+1):
            cht.add_line(-2*i, i*i-acc[i])
        
        res = 10**18
        
        for i in range(r, m, -1):
            res = min(res, cht.get(i)+i*i+acc[i])
            ans[i-1] = min(ans[i-1], res)
    
    dfs(l, m)
    dfs(m, r)
    
N = int(input())
A = list(map(int, input().split()))
acc = [0]

for Ai in A:
    acc.append(acc[-1]+Ai)

ans = [10**18]*N
dfs(0, N)

for i in range(N):
    print(ans[i])