#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

struct ConvexHullTrick {
  using F = pair<i64, i64>;
  deque<F> deq;
  #define a first
  #define b second
  #define lines deq.size()
  bool invalid(F f0, F f1, F f2) {
    return (__int128_t) (f1.a - f0.a) * (f2.b - f1.b) >= (__int128_t) (f1.b - f0.b) * (f2.a - f1.a);
  }
  i64 f(F f, i64 x) {
    return f.a * x + f.b;
  }
  void add(F f) {
    while (lines >= 2 && invalid(deq[lines - 2], deq[lines - 1], f)) {
      deq.pop_back();
    }
    deq.push_back(f);
  }
  i64 min(i64 x) {
    while (lines >= 2 && f(deq[0], x) >= f(deq[1], x)) {
      deq.pop_front();
    }
    return f(deq[0], x);
  }
  #undef a
  #undef b
  #undef lines
};

void solve() {
  int N;
  cin >> N;
  i64 sums[N + 1], dp[N + 2][N + 1];
  sums[0] = 0;
  rep(i, N) cin >> sums[i + 1], sums[i + 1] += sums[i];
  rep(i, N + 2) rep(j, N + 1) dp[i][j] = 1e18;
  rep(i, N + 2) dp[i][0] = 0;
  
  rep(i, N + 2) {
    ConvexHullTrick cht;
    rep(j, N + 1) {
      if (i + j + 1 > N + 1) break;
      i64 a = -2 * sums[i + j];
      i64 b = sums[i + j] * sums[i + j] + dp[i + j][j];
      i64 x = sums[i + j];
      i64 y = sums[i + j] * sums[i + j];
      cht.add(make_pair(a, b));
      dp[i + j + 1][j] = cht.min(x) + y;
    }
  }
  rep(i, N) {
    cout << dp[N + 1][i + 1] << endl;
  }
}