#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1e18;
const int mod = (int)1e9 + 7;
const int MAXN = (int)3e5 + 5;
long long n;
bool a[MAXN];
int dp[85][85][85 * 85];
vector<int> vc;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int ls = -1;
  for (int i = 0; i < n; i++) {
    if (a[i]) {
      vc.push_back(i - ls - 1);
      ls = i;
    }
  }
  vector<int> z;
  vc.push_back(n - ls - 1);
  int l = vc.size();
  z.push_back(vc[0]);
  for (int i = 1; i < l; i++) {
    z.push_back(z.back() + vc[i]);
  }
  int zer = z.back();
  memset(dp, 0x7f, sizeof(dp));
  dp[0][0][0] = 0;
  for (int i = 0; i < l; i++) {
    for (int j = 0; j <= zer; j++) {
      for (int l = 0; l < n * (n - 1) / 2 + 1; l++) {
        if (dp[i][j][l] > mod) continue;
        for (int k = j; k <= zer; k++) {
          if (l + abs(z[i] - k) > n * (n - 1) / 2) continue;
          int &u = dp[i + 1][k][l + abs(z[i] - k)];
          u = min(u, dp[i][j][l] + (k - j) * (k - j));
        }
      }
    }
  }
  int mn = mod;
  for (int i = 0; i < n * (n - 1) / 2 + 1; i++) {
    mn = min(mn, dp[l][zer][i]);
    cout << (zer * zer - mn) / 2 << " ";
  }
}
