#include <bits/stdc++.h>
#define ll long long
#define pir pair <ll, ll>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const ll maxn = 1e5 + 10; 
ll n, z[maxn];
char s[maxn];
int main(){
	scanf("%s", s + 1); n = strlen(s + 1);
	printf("0 ");
	for(ll i = 2, j = 0; i <= n; i++) {
		if(j + z[j] > i)
			z[i] = min(j + z[j] - i, z[i - j + 1]);
		while(s[z[i] + 1] == s[z[i] + i]) ++z[i];
		if(i + z[i] > j + z[j]) j = i;
		printf("%lld ", z[i]);
	}
	return 0;
}