#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int n; cin >> n;
  vector<long long> a(n); REP(i, n) cin >> a[i];
  vector<vector<long long> > danger(n, vector<long long>(n, 0));
  REP(i, n) {
    danger[i][i] = a[i];
    FOR(j, i + 1, n) danger[i][j] = danger[i][j - 1] + a[j];
    danger[i][i] *= danger[i][i];
    FOR(j, i + 1, n) danger[i][j] *= danger[i][j];
  }
  vector<vector<long long> > dp(n + 2, vector<long long>(n + 1, LINF));
  dp[0][0] = 0;
  REP(i, n) REP(j, i + 1) {
    for (int x = 0; x + j <= n && i + x - 1 < n; ++x) {
      dp[i + x + 1][j + x] = min(dp[i + x + 1][j + x], dp[i][j] + (x > 0 ? danger[i][i + x - 1] : 0));
    }
    // REP(i, n + 2) {
    //   REP(j, n + 1) cout << (dp[i][j] == LINF ? -1 : dp[i][j]) << ' ';
    //   cout << '\n';
    // }
    // cout << '\n';
  }
  FOR(j, 1, n + 1) cout << min(dp[n][j], dp[n + 1][j]) << '\n';
  return 0;
}