#include<bits/stdc++.h>
#define N 200010
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Down(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int n,tot=1,lst=1,nxt[N][26];
int ans[N],lnk[N],len[N],id[N];
bool mark[N];
char s[N];
vector<int> go[N];
inline void insert(int v,int pos)
{
    int nw=++tot,nd=lst;
    len[nw]=len[nd]+1,lst=nw,id[pos]=nw;
    while(nd && !nxt[nd][v]) nxt[nd][v]=nw,nd=lnk[nd];
    if(!nd) {lnk[nw]=1;return;}
    int q=nxt[nd][v];
    if(len[q] == len[nd]+1) {lnk[nw]=q;return;}
    int clone=++tot;
    memcpy(nxt[clone],nxt[q],sizeof(nxt[q]));
    lnk[clone]=lnk[q],len[clone]=len[nd]+1;
    while(nd && nxt[nd][v] == q) nxt[nd][v]=clone,nd=lnk[nd];
    return void(lnk[nw]=lnk[q]=clone);
}

inline void dfs(int x,int nwans)
{
    if(mark[x]) nwans=len[x];
    ans[x]=nwans;
    for(int to:go[x]) dfs(to,nwans);
    return;
}

int main()
{
    scanf("%s",s+1),n=strlen(s+1);
    Down(i,n,1) insert(s[i]-'a',i);
    For(i,2,tot) go[lnk[i]].push_back(i);
    for(int x=id[1];x;x=lnk[x]) mark[x]=true;
    dfs(1,0),printf("%d ",0);
    For(i,2,n) printf("%d ",ans[id[i]]);
    return 0;
}