#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 5e5+5;
int n,last=1,tot=1,tr[N][26],fa[N],len[N],sz[N],t[N],a[N],ans[N];
char s[N];
void extend(int c)
{
    int v=last,u=++tot;last=u;
    len[u]=len[v]+1;
    while (v&&!tr[v][c]) tr[v][c]=u,v=fa[v];
    if (!v) fa[u]=1;
    else
    {
        int x=tr[v][c];
        if (len[x]==len[v]+1) fa[u]=x;
        else
        {
            int y=++tot;
            memcpy(tr[y],tr[x],sizeof(tr[y]));
            fa[y]=fa[x];fa[x]=fa[u]=y;len[y]=len[v]+1;
            while (v&&tr[v][c]==x) tr[v][c]=y,v=fa[v];
        }
    }
    sz[u]=1;
}
int main()
{
    scanf("%s",s+1);n=strlen(s+1);
    for (int i=1;i<=n;++i) extend(s[i]-'a');
    for (int i=1;i<=tot;++i) ++t[len[i]];
    for (int i=1;i<=tot;++i) t[i]+=t[i-1];
    for (int i=1;i<=tot;++i) a[t[len[i]]--]=i;
    for (int i=tot;i;--i)
    {
        sz[fa[a[i]]]+=sz[a[i]];
        ans[len[a[i]]]=max(ans[len[a[i]]],sz[a[i]]);
    }
    for (int i=n;i;--i) ans[i]=max(ans[i],ans[i+1]);
    for (int i=1;i<=n;++i) printf("%d\n",ans[i]);
    return 0;
}