#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  int n = s.length();
  vector<vector<int>> dp(n, vector<int>(n));
  for (int i = 0; i < n; ++i) {
    dp[i][i] = 1;
    if (i + 1 < n) {
      dp[i][i + 1] = (s[i] == s[i + 1]) ? 2 : 0;
    }
  }
  for (int len = 3; len <= n; ++len) {
    for (int i = 0; i + len - 1 < n; ++i) {
      int j = i + len - 1;
      if (dp[i + 1][j - 1] > 0 && s[i] == s[j]) {
        int m = (i + j + 1) / 2 - 1;
        dp[i][j] = dp[i][m] + 1;
      }
    }
  }
  vector<int> cnt(n + 1);
  for (int i = 0; i < n; ++i) {
    for (int j = i; j < n; ++j) {
      ++cnt[dp[i][j]];
    }
  }
  int cur = 0;
  vector<int> ans(n);
  for (int i = n; i >= 1; --i) {
    cur += cnt[i];
    ans[i - 1] = cur;
  }
  for (int x : ans) {
    printf("%d ", x);
  }
  puts("");
}
