#include<bits/stdc++.h>

using llu=unsigned long long;

const int N=1e5+5,B=13131;

int n;
char s[N];

llu pw[N],phs[N];
llu Ghs(int l,int r){
    return phs[r]-phs[l-1]*pw[r-l+1];
}
int Bound(int i){
    if(i==1) return 0;
    int l=1,r=n-i+1,res=0;
    while(l<=r){
        int mid=(l+r)>>1;
        if(Ghs(1,mid)==Ghs(i,i+mid-1)) res=mid,l=mid+1;
        else r=mid-1;
    }
    return res;
}

int main(){
    scanf(" %s",s+1),n=strlen(s+1);
    pw[0]=1;
    for(int i=1;i<=n;++i){
        pw[i]=pw[i-1]*B;
        phs[i]=phs[i-1]*B+s[i];
    }
    for(int i=1;i<=n;++i) printf("%d%c",Bound(i)," \n"[i==n]);
    return 0;
}