#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std;
const int N = 2e6 + 5;
int n, m;
string s;
int x[N], y[N], c[N], sa[N], rk[N], ht[N];
void getsa() {
	m = 'z';
	for (int i = 1; i <= n; ++ i) ++ c[x[i] = s[i - 1]];
	for (int i = 2; i <= m; ++ i) c[i] += c[i - 1];
	for (int i = n; i; -- i) sa[c[x[i]] --] = i;
	for (int k = 1; k <= n; k <<= 1) {
		int idx = 0;
		for (int i = n - k + 1; i <= n; ++ i) y[++ idx] = i;
		for (int i = 1; i <= n; ++ i) if (sa[i] > k) y[++ idx] = sa[i] - k;
		for (int i = 1; i <= m; ++ i) c[i] = 0;
		for (int i = 1; i <= n; ++ i) ++ c[x[i]];
		for (int i = 2; i <= m; ++ i) c[i] += c[i - 1];
		for (int i = n; i; -- i) sa[c[x[y[i]]] --] = y[i], y[i] = 0;
		swap(x, y); idx = 1; x[sa[1]] = 1;
		for (int i = 2; i <= n; ++ i) 
			x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k] ? idx : ++ idx);
		if (idx == n) break;
		m = idx;
	}
}
void getht() {
	for (int i = 1; i <= n; ++ i) rk[sa[i]] = i;
	for (int i = 1, k = 0; i <= n; ++ i) {
		if (rk[i] == 1) continue;
		const int j = sa[rk[i] - 1];
		if (k) -- k;
		while (i + k <= n && j + k <= n && s[i + k - 1] == s[j + k - 1]) ++ k;
		ht[rk[i]] = k;
	}
}
const int M = 18;
int st[M][N];
void prepost() {
	for (int i = 1; i <= n; ++ i) 
		st[0][i] = ht[i];
	for (int i = 1; i < M; ++ i) {
		for (int j = 1; j + (1 << i - 1) <= n; ++ j) 
			st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
	}
}
inline int getlcp(int x, int y) {
	if (x == y) return 0;
	int l = rk[x], r = rk[y];
	if (l > r) swap(l, r);
	++ l;
	const int z = __lg(r - l + 1);
	return min(st[z][l], st[z][r - (1 << z) + 1]);
}
signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> s;
	n = s.size();
	getsa(); getht(); prepost();
	for (int i = 1; i <= n; ++ i) cout << getlcp(1, i) << " \n"[i == n];
	// for (int i = 1; i <= n; ++ i) cout << sa[i] << " \n"[i == n];
	return 0;
}