#include <bits/stdc++.h>
const int N = 5005;
int n, dp[N], ans[N];
char s[N];
struct pam {
  int tot, lst, ch[N][26], fail[N], len[N], cnt[N];
  int l, s[N];
  void init() {
    fail[1] = 0;
    fail[2] = 1;
    len[1] = -1;
    len[2] = 0;
    l = 0;
    s[0] = -1;
    tot = 2;
    lst = 1;
  }
  void ins(int c) {
    s[++l] = c;
    int p = lst;
    for (; s[l - len[p] - 1] != s[l]; p = fail[p])
      ;
    if (!ch[p][c]) {
      int q = ++tot;
      len[q] = len[p] + 2;
      if (p == 1)
        fail[q] = 2;
      else {
        int k = fail[p];
        for (; s[l - len[k] - 1] != s[l]; k = fail[k])
          ;
        fail[q] = ch[k][c];
      }
      ch[p][c] = q;
    }
    lst = ch[p][c];
    cnt[lst]++;
  }
  void build() {
    for (int j = tot; j > 2; --j) cnt[fail[j]] += cnt[j];
  }
} t;
int main() {
  scanf("%s", s);
  n = strlen(s);
  t.init();
  for (int j = 0; j < n; ++j) t.ins(s[j] - 'a');
  t.build();
  for (int i = 3; i <= t.tot; ++i) {
    dp[i] = 1;
    for (int j = t.fail[i]; j; j = t.fail[j])
      if (t.len[j] == t.len[i] / 2) {
        dp[i] = dp[j] + 1;
        break;
      }
    ans[dp[i]] += t.cnt[i];
  }
  for (int i = n; i; --i) ans[i] += ans[i + 1];
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
