#include <bits/stdc++.h>

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n;
  std::cin >> n;
  std::vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
  }
  int m = *std::max_element(a.begin(), a.end());

  using state = std::pair<int, int>;

  std::vector f(n + 1, std::vector(n + 1, std::vector<state>(2 * m + 1)));
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= 2 * m; ++j) {
      f[i][i][j] = state(0, -j);
    }
  }
  for (int l = n - 1; l >= 0; --l) {
    for (int r = l + 1; r <= n; ++r) {
      for (int k = 0; k <= 2 * m; ++k) {
        int v = std::max(k, a[l]);
        f[l][r][k] = state(n * m, 0);
        for (int i = l + 1; i <= r; ++i) {
          auto tmp = f[i][r][v / 2 - f[l + 1][i][0].second];
          tmp.first += v - k + f[l + 1][i][0].first;
          f[l][r][k] = std::min(f[l][r][k], tmp);
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    std::cout << f[0][i][0].first << " \n"[i == n];
  }
}