#include <bits/stdc++.h>
using namespace std;
const int MX = 5003;
int pal[MX][MX];
int m[MX];
int main() {
  string s;
  cin >> s;
  int ln = s.size();
  for (int i = 0; i < ln; i++) {
    pal[i][i] = 1;
    m[1]++;
  }
  for (int i = 0; i < ln - 1; i++) {
    if (s[i] == s[i + 1]) {
      pal[i][i + 1] = 2;
      m[2]++;
    }
  }
  for (int len = 3; len <= ln; len++) {
    for (int i = 0; i < ln - len + 1; i++) {
      int j = i + len - 1;
      if (s[i] != s[j]) continue;
      if (pal[i][i + len / 2 - 1] == pal[i + len / 2 + len % 2][j]) {
        if (pal[i + 1][j - 1] != 0) {
          pal[i][j] = pal[i][i + len / 2 - 1] + 1;
          m[pal[i][j]]++;
        }
      } else {
        if (pal[i + 1][j - 1] != 0) {
          pal[i][j] = 1;
          m[1]++;
        }
      }
    }
  }
  int sum = 0;
  for (int i = ln; i >= 1; i--) m[i] = m[i] + m[i + 1];
  for (int i = 1; i <= ln; i++) cout << m[i] << " ";
  cout << endl;
  return 0;
}
