/** @xigua */

#include <stdio.h>

#include <cmath>

#include <iostream>

#include <algorithm>

#include <vector>

#include <stack>

#include <cstring>

#include <queue>

#include <set>

#include <string>

#include <map>

#include <climits>

#define PI acos(-1)

#define rep(a,b,c) for(int (a)=(b); (a)<(c); ++(a))

#define drep(a,b,c) for(int (a)=(b); (a)>(c); --(a))

#define CLR(x) memset(x, 0, sizeof(x))

#define sf scanf

#define pf printf

using namespace std;

typedef long long ll;

typedef double db;

const int maxn = *  + ;

const int ma = 1e5 + ;

const int mod = 1e9 + ;

const int INF = 1e8 + ;

const ll inf = 1e17 + ;

const db eps = 1e-;

const int MAXN = 2e5+1e3;

struct SAM{

    int ch[maxn<<][];

    int fa[maxn<<], len[maxn<<];

    int cnt, last, root;

    void init() {

        root=;

        memset(ch, , sizeof(ch));

        memset(fa, , sizeof(fa));

        last=cnt=root;

    }

    void add(int c) {

        int p=last, np=last=++cnt;

        len[np]=len[p]+;

        while(!ch[p][c] && p) {

            ch[p][c]=np;

            p=fa[p];

        }

        if (p==)  fa[np]=;

        else {

            int q = ch[p][c];

            if(len[p] +  == len[q]) {

                fa[np] = q;

            }

            else {

                int nq = ++cnt;

                len[nq] = len[p] + ;

                memcpy(ch[nq], ch[q], sizeof ch[q]);

                fa[nq] = fa[q];

                fa[q] = fa[np] = nq;

                while(ch[p][c] == q && p) {

                    ch[p][c] = nq;

                    p = fa[p];

                }

            }

        }

    }

    int find(char *s) {

        int p=root, l=, c=;

        int lenn=strlen(s);

        for(int i = ; i < lenn; i++) {

            if(ch[p][s[i] - 'a']) {

                p = ch[p][s[i] - 'a'];

                c++;

            }

            else {

                while(p&&!ch[p][s[i]-'a'])  p=fa[p];

                if (!p)  c=, p=;

                else  c=len[p]+, p=ch[p][s[i]-'a'];

            }

            l = max(l, c);

        }

        printf("%d\n", l);

    }

}sam;

char s[maxn];

int c[maxn<<], pt[maxn<<], f[maxn];

void innt() {

    memset(pt, , sizeof(pt));

    memset(c, , sizeof(c));

    memset(f, , sizeof(f));

}

void top() {

    for (int i=; i<=sam.cnt; i++)

        c[sam.len[i]]++;

    for (int i=; i<=sam.cnt; i++)

        c[i]+=c[i-];

    for (int i=sam.cnt; i>=; i--)

        pt[c[sam.len[i]]--]=i;      // /*拓扑排序*/ //

    /*每个子串对应相应的pt*/

}

int dp[maxn];

void solve() {

    innt();

    scanf("%s", s);

    int lenn=strlen(s);

    sam.init();

    for (int i=; i<lenn; i++) {

        sam.add(s[i]-'a');

    }

    top();

    memset(dp, , sizeof(dp));

    int p=sam.root;

    for (int i=; i<lenn; i++) {

        p=sam.ch[p][s[i]-'a'];

        if (p) dp[p]++;     //先找出所有子串令dp[p]=1

    }

    for (int i=sam.cnt; i>=; i--)  {

        p=pt[i];

        if (sam.fa[p])  dp[sam.fa[p]]+=dp[p];

        /*该子串(a)还应加上作为串(aa)的个数*/

    }

    for (int i=; i<=sam.cnt; i++) {

        f[sam.len[i]]=max(f[sam.len[i]], dp[i]);

    }

    for(int i=lenn-;i>=;--i){

        if (f[i]<f[i+])  f[i]=f[i+];

    }

    for (int i=; i<=lenn; i++)

        printf("%d\n", f[i]);

}

int main() {

    int t = , cas = ;

    //freopen("in.txt", "r", stdin);

   // freopen("out.txt", "w", stdout);

    //scanf("%d", &t);

    while(t--) {

       // printf("Case %d: ", cas++);

        solve();

    }

    return ;

}