#include <bits/stdc++.h>
using namespace std;
int dp[5005][5005], ispal[5005][5005];
int cnt[5005], ans[5005];
int solve(int i, int j) {
  if (dp[i][j]) return dp[i][j];
  if (!ispal[i][j]) return dp[i][j] = 0;
  if (j == i) return dp[i][j] = 1;
  if (j == i + 1) return dp[i][j] = 2;
  int mid = (i + j) >> 1;
  if (!((j - i) & 1))
    return dp[i][j] = (min(solve(i, mid - 1), solve(mid + 1, j)) + 1);
  else
    return dp[i][j] = (min(solve(i, mid), solve(mid + 1, j)) + 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  int n = s.size();
  s = "a" + s;
  for (int i = n; i >= 1; i--) {
    ispal[i][i] = 1;
    if (s[i] == s[i + 1]) ispal[i][i + 1] = 1;
    for (int j = i + 2; j <= n; j++)
      ispal[i][j] = (s[i] == s[j] && ispal[i + 1][j - 1]);
  }
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) cnt[solve(i, j)]++;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= i; j++) ans[j] += cnt[i];
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
