#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
string s;
int n, dp[maxn][maxn], cnt[maxn];
bool check[maxn][maxn];
int main() {
  int i, j, d;
  cin >> s;
  n = s.length();
  for (i = 1; i <= n; i++) check[i][i] = true;
  for (i = 1; i < n; i++)
    if (s[i - 1] == s[i]) check[i][i + 1] = true;
  for (d = 3; d <= n; d++)
    for (i = 1; i <= n - d + 1; i++) {
      j = i + d - 1;
      check[i][j] = check[i][j] | (s[i - 1] == s[j - 1] & check[i + 1][j - 1]);
    }
  for (i = 1; i <= n; i++) {
    dp[i][i] = 1;
    cnt[1]++;
  }
  for (d = 2; d <= n; d++)
    for (i = 1; i <= n - d + 1; i++) {
      j = i + d - 1;
      if (check[i][j] == true) dp[i][j] = dp[i][i + d / 2 - 1] + 1;
      cnt[dp[i][j]]++;
    }
  for (i = n - 1; i >= 1; i--) cnt[i] += cnt[i + 1];
  for (i = 1; i <= n; i++) cout << cnt[i] << " ";
  return 0;
}
