#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5005;
int dp[MAXN][MAXN];
int pal[MAXN];
string str;
int main() {
  cin >> str;
  int n = str.size();
  for (int i = 0; i < n; i++) {
    dp[i][i] = 1;
    if (i < n - 1 && str[i] == str[i + 1]) dp[i + 1][i] = 2;
  }
  for (int k = 3; k <= n; k++) {
    for (int i = k - 1; i < n; i++) {
      if (str[i] != str[i - k + 1]) continue;
      if (!dp[i - 1][i - k + 2]) continue;
      dp[i][i - k + 1] = dp[i - (k + 1) / 2][i - k + 1] + 1;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      pal[dp[i][j]]++;
    }
  }
  for (int i = n - 1; i > 0; i--) {
    pal[i] += pal[i + 1];
  }
  for (int i = 1; i <= n; i++) {
    cout << pal[i] << ' ';
  }
  cout << endl;
}
