#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 5;
const int INF = 0x3f3f3f3f;
char s[N];
int dp[N][N], ans[N];
int main() {
  ios::sync_with_stdio(false);
  cin >> s;
  int n = strlen(s);
  memset(dp, 0, sizeof(dp));
  memset(ans, 0, sizeof(ans));
  for (int i = 0; i < n; ++i) {
    dp[i][i] = 1;
    ans[1]++;
  }
  for (int k = 2; k <= n; ++k) {
    for (int i = 0; i + k - 1 < n; ++i) {
      int j = i + k - 1;
      if (s[i] == s[j] && (i + 1 > j - 1 || dp[i + 1][j - 1])) {
        dp[i][j] = dp[i][i + k / 2 - 1] + 1;
        for (int t = 1; t <= dp[i][j]; ++t) ans[t]++;
      }
    }
  }
  cout << ans[1];
  for (int i = 2; i <= n; ++i) cout << " " << ans[i];
  cout << endl;
}
