#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 100005;

struct SAM {
  int ch[N][26], len[N], link[N], pos[N], cnt[N], sz;
  // node -> strings with the same endpos set
  // length in range [len(link) + 1, len]
  // node's endpos set -> pos in the subtree of node
  // link -> longest suffix with different endpos set
  // len  -> longest suffix
  // pos  -> end position
  // cnt  -> size of endpos set
  SAM () {len[0] = 0, link[0] = -1, pos[0] = 0, cnt[0] = 0, sz = 1;}
  void build(string s) {
    int last = 0;
    for (int i = 0; i < s.length(); ++i) {
      char c = s[i];
      int cur = sz++;
      len[cur] = len[last] + 1, pos[cur] = i + 1;
      int p = last;
      while (~p && !ch[p][c - 'a'])
        ch[p][c - 'a'] = cur, p = link[p];
      if (p == -1) link[cur] = 0;
      else {
        int q = ch[p][c - 'a'];
        if (len[p] + 1 == len[q]) {
          link[cur] = q;
        } else {
          int nxt = sz++;
          len[nxt] = len[p] + 1, link[nxt] = link[q];
          pos[nxt] = 0;
          for (int j = 0; j < 26; ++j)
            ch[nxt][j] = ch[q][j];
          while (~p && ch[p][c - 'a'] == q)
            ch[p][c - 'a'] = nxt, p = link[p];
          link[q] = link[cur] = nxt;
        }
      }
      cnt[cur]++;
      last = cur;
    }
    vector <int> p(sz);
    iota(all(p), 0);
    sort(all(p),
      [&](int i, int j) {return len[i] > len[j];});
    for (int i = 0; i < sz; ++i)
      cnt[link[p[i]]] += cnt[p[i]];
  }
} sam;

vector <int> adj[N];
set <int> pos[N];
int ans[N], sz[N];

int query(int v, int len) {
    int ans = 0;
    auto it = pos[v].lower_bound(0);
    while (it != pos[v].end()) {
        ans++;
        int x = *it;
        it = pos[v].lower_bound(x + len);
    }
    return ans;
}

void dfs(int v) {
    int mx = -1;
    for (int u : adj[v]) {
        dfs(u);
        sz[v] += sz[u];
        if (mx == -1 || sz[u] > sz[mx]) {
            mx = u;
        }
    }
    if (mx != -1) {
        swap(pos[mx], pos[v]);
    }
    for (int u : adj[v]) {
        for (int j : pos[u]) {
            pos[v].insert(j);
        }
        pos[u].clear();
    }
    if (v) {
        int cnt = sam.cnt[v];
        assert(pos[v].size() == cnt);
        int l = sam.len[sam.link[v]] + 1, r = sam.len[v] + 1;
        int x = query(v, l);
        while (r - l > 1) {
            int m = l + r >> 1;
            if (query(v, m) == x) {
                l = m;
            } else {
                r = m;
            }
        }
        ans[cnt] = max(ans[cnt], l);
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    string s; cin >> s;
    int n = s.length();
    sam.build(s);
    for (int i = 1; i < sam.sz; ++i) {
        adj[sam.link[i]].pb(i);
        if (sam.pos[i] > 0) {
            pos[i].insert(sam.pos[i]), sz[i] = 1;
        }
    }
    dfs(0);
    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << " \n"[i == n];
    }
}