1/* ***********************************************
 2Author :111qqz
 3Created Time :2017年11月14日 星期二 01时01分03秒
 4File Name :2565.cpp
 5************************************************ */
 6
 7#include <bits/stdc++.h>
 8#define PB push_back
 9#define fst first
10#define sec second
11#define lson l,m,rt<<1
12#define rson m+1,r,rt<<1|1
13#define ms(a,x) memset(a,x,sizeof(a))
14typedef long long LL;
15#define pi pair < int ,int >
16#define MP make_pair
17
18using namespace std;
19const double eps = 1E-8;
20const int dx4[4]={1,0,0,-1};
21const int dy4[4]={0,-1,1,0};
22const int inf = 0x3f3f3f3f;
23const int N=1E5+7;
24struct PAM
25{
26    int fail,cnt,len;
27    int nxt[26];
28}st[N];
29char S[N],RS[N];
30int n,now,sz;
31void pam_init()
32{
33    ms(st,0);
34    st[0].fail = st[1].fail = 1;
35    st[1].len = -1;
36    sz = 1;
37}
38void extend(int c,int pos)  
39{
40    int p = now;
41    while (S[pos-st[p].len-1]!=S[pos]) p = st[p].fail;
42    if (!st[p].nxt[c]){
43    int np=++sz,q=st[p].fail;
44    st[np].len=st[p].len+2;
45    while (S[pos-st[q].len-1]!=S[pos]) q=st[q].fail;
46    st[np].fail=st[q].nxt[c];
47    st[p].nxt[c] = np;
48    }
49    now=st[p].nxt[c];
50    st[now].cnt++;
51}
52int main()
53{
54    #ifndef  ONLINE_JUDGE 
55//  freopen("./in.txt","r",stdin);
56  #endif 
57    scanf("%s",S);
58    pam_init();
59    n = strlen(S);
60    vector <int>ans;
61    for ( int i = 0 ; i < n; i++) extend(S[i]-'a',i),ans.PB(sz-1);
62    int siz = ans.size();
63    for ( int i = 0 ; i < siz ; i++) printf("%d%c",ans[i],i==siz-1?'\n':' ');
64  #ifndef ONLINE_JUDGE  
65  fclose(stdin);
66  #endif
67    return 0;
68}