#include <bits/stdc++.h>
using namespace std;
const int M = 1000000 + 10;
const int N = 5000 + 10;
char s[N];
int is[N][N], ans[N];
int deal(int l, int r) {
  if (l == r) return 1;
  if (!is[l][r]) return 0;
  return deal(l, l + (r - l + 1) / 2 - 1) + 1;
}
signed main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; ++i) {
    is[i][i] = 1;
    if (i + 1 <= len && s[i] == s[i + 1]) is[i][i + 1] = 1;
  }
  for (int k = 3; k <= len; ++k) {
    for (int l = 1; l <= len - k + 1; ++l) {
      int r = l + k - 1;
      if (is[l + 1][r - 1] && s[l] == s[r]) is[l][r] = 1;
    }
  }
  for (int i = 1; i <= len; ++i) {
    for (int j = i; j <= len; ++j) {
      ans[deal(i, j)]++;
    }
  }
  for (int i = len - 1; i >= 1; --i) ans[i] += ans[i + 1];
  for (int i = 1; i <= len; ++i) printf("%d%c", ans[i], i == len ? '\n' : ' ');
  return 0;
}
