#include <bits/stdc++.h>
const int maxn = 1000000 + 10;
int n, times, nxt[maxn], fa[maxn], L[maxn], R[maxn], ans[maxn];
std::vector<int> e[maxn]; char S[maxn];
inline void dfs (int u)
{
    L[u] = ++times;
    for (int v: e[u]) dfs(v);
    R[u] = times;
}
inline bool Subtree (int u, int v) {return L[u] <= L[v] and R[v] <= R[u];}
inline int find (int x) {return fa[x] == x ? x : fa[x] = find(fa[x]);}
signed main ()
{
    scanf("%s", S + 1); n = strlen(S + 1);
    for (int i = 2, j = 0; i <= n; i++)
    {
        while (j and S[j + 1] != S[i]) j = nxt[j];
        if (S[j + 1] == S[i]) j++;
        nxt[i] = j;
    }
    for (int i = 1; i <= n; i++) e[nxt[i]].push_back(i), fa[i] = i;
    dfs(0);
    for (int i = 1; i <= n / 2; i++) if (Subtree(i, n))
    {
        int w = 2;
        for (int j = 2 * i; j <= n - i; j = find(j) + 1) Subtree(i, j) ? (w++, j += i - 1) : (fa[j - 1] = j);
        ans[w] = i;
    }
    for (int i = n; i >= 2; i--) ans[i] = std::max(ans[i], ans[i + 1]);
    for (int i = 2; i <= n; i++) printf("%d%c", ans[i], " \n"[i == n]);
    return 0;
}