#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 1e5 + 5;
const int maxm = 2e5 + 5;

int n, m;
int sa[maxn], cnt[maxn], rk[maxn], tmp[maxn];
int height[maxn], z[maxn];
char s[maxn];

void getsa() {
	for(int i = 1; i <= n; i++) cnt[rk[i] = s[i]]++;
	for(int i = 1; i <= m; i++) cnt[i] += cnt[i-1];
	for(int i = n; i >= 1; i--) sa[cnt[rk[i]]--] = i;
	for(int w = 1, t = 0; ; m = t, t = 0, w <<= 1) {
		for(int i = n-w+1; i <= n; i++) tmp[++t] = i;
	    for(int i = 1; i <= n; i++) if(sa[i] > w) tmp[++t] = sa[i] - w;
		for(int i = 0; i <= m; i++) cnt[i] = 0;
		for(int i = 1; i <= n; i++) cnt[rk[tmp[i]]]++;
		for(int i = 1; i <= m; i++) cnt[i] += cnt[i-1];
		for(int i = n; i >= 1; i--) sa[cnt[rk[tmp[i]]]--] = tmp[i];
		swap(rk, tmp); t = 0;
		for(int i = 1; i <= n; i++) 
			rk[sa[i]] = (tmp[sa[i]] == tmp[sa[i-1]]
			        && tmp[sa[i]+w] == tmp[sa[i-1]+w] ? t : ++t);
		if(t == n) break;
	}
	for(int i = 1, p = 0; i <= n; i++) {
		if(!rk[i]) continue;
		if(p) p--;
		while(s[i+p] == s[sa[rk[i]-1]+p]) p++;
		height[rk[i]] = p;
	}
}

int main() {
	scanf("%s", s+1);
	n = strlen(s+1), m = 256;
	getsa();

    int d = rk[1], t = n;
	for(int i = d+1; i <= n; i++) {
		t = min(t, height[i]);
		z[sa[i]] = t;
	}
	t = n;
	for(int i = d; i > 1; i--) {
		t = min(t, height[i]);
		z[sa[i-1]] = t;
	}
	for(int i = 1; i <= n; i++)
		printf("%d ", z[i]);
	return 0;
}