#include <bits/stdc++.h>
using namespace std;

namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(!isalpha(ch)) ch = getc();
		while(isalpha(ch)) s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 1e6 + 10;
int n, w, rk[N], sec[N], sa[N], cnt[N];
char s[N];
void rsort() {
	for(int i = 1; i <= w; i++) cnt[i] = 0;
	for(int i = 1; i <= n; i++) cnt[rk[i]]++;
	for(int i = 1; i <= w; i++) cnt[i] += cnt[i - 1];
	for(int i = n; i; i--) sa[cnt[rk[sec[i]]]--] = sec[i], sec[i] = 0;
}
void SA() {
	for(int i = 1; i <= n; i++)
		rk[i] = s[i], sec[i] = i;
	w = 131;
	rsort();
	for(int k = 1; k <= n; k <<= 1) {
		int tot = 0;
		for(int i = n - k + 1; i <= n; i++)
			sec[++tot] = i;
		for(int i = 1; i <= n; i++)
			if(sa[i] > k) sec[++tot] = sa[i] - k;
		rsort();
		swap(rk, sec);
		rk[sa[1]] = tot = 1;
		for(int i = 2; i <= n; i++)
			if(sec[sa[i]] == sec[sa[i - 1]] && sec[sa[i] + k] == sec[sa[i - 1] + k])
				rk[sa[i]] = tot;
			else rk[sa[i]] = ++tot;
		if(tot == n) break;
		w = tot;
	}
}
int hei[N];
void geth() {
	int k = 0;
	for(int i = 1; i <= n; i++) {
		if(rk[i] == 1) continue;
		if(k) k--;
		while(i + k <= n && sa[rk[i] - 1] + k <= n && s[i + k] == s[sa[rk[i] - 1] + k]) k++;
		hei[rk[i]] = k;
//		cout << rk[i] << " " << k << endl; 
	}
}
namespace ST_table {
	int st[20][N];
	void init() {
		for(int i = 1; i <= n; i++)
			st[0][i] = hei[i];
		for(int i = 1; (1 << i) <= n; 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)]);
	}
	int query(int l, int r) {
		int L = 31 ^ __builtin_clz(r - l + 1);
		return min(st[L][l], st[L][r - (1 << L) + 1]);
	}
} using namespace ST_table;
int LCP(int i, int j) {
	int l = rk[i], r = rk[j];
	if(l > r) swap(l, r);
	if(l == r) return 0;
	return query(l + 1, r); 
}
int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	SA();
	geth();
	init();
	for(int i = 1; i <= n; i++)
		printf("%d ", LCP(1, i));
	return 0;
}