#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int64 N;
  cin >> N;
  vector< int64 > A(N);
  cin >> A;


  vector< int64 > S(N + 1);
  for(int i = 1; i <= N; i++) S[i] = S[i - 1] + A[i - 1];

  auto cost = [&](int64 l, int64 r) {
    if(l > r) swap(l, r);
    return (r - l + 1) * (r - l + 1) + (S[r + 1] - S[l]);
  };
  auto monotone_minima = [&](int A, int B, int C, int D) {
    vector< int64 > dp(B - A + 1, infll);
    auto dfs = MFP([&](auto dfs, int a, int b, int c, int d) -> void {
      if(a > b) return;
      int md = (a + b) / 2;
      int64 ret = infll;
      int pos = -1;
      for(int l = c; l <= d; l++) {
        if(chmin(ret, cost(md, l))) pos = l;
      }
      chmin(dp[md - A], ret);
      dfs(a, md - 1, c, pos);
      dfs(md + 1, b, pos, d);
    });
    dfs(A, B, C, D);
    return dp;
  };
  vector< int64 > dp(N, infll);
  auto rec = MFP([&](auto rec, int a, int b) -> void {
    if(a + 1 >= b) {
      chmin(dp[a], cost(a, a));
    } else {
      int md = (a + b) / 2;
      rec(a, md);
      rec(md + 1, b);
      auto latte = monotone_minima(a, md - 1, md, b - 1);
      auto malta = monotone_minima(md, b - 1, a, md);
      int64 ret = infll;
      for(int k = a; k < md; k++) {
        chmin(ret, latte[k - a]);
        chmin(dp[k], ret);
      }
      ret = infll;
      for(int k = b - 1; k >= md; k--) {
        chmin(ret, malta[k - md]);
        chmin(dp[k], ret);
      }
    }
  });

  rec(0, N);
  for(auto &p : dp) cout << p << "\n";

}