#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e7 + 5;
string s1, s2;
int n, m, nxt[maxn], ext[maxn];
void solve1() {
	int p = 0, k = 1;
	nxt[0] = 0;
	while(p + 1 < m && s2[p] == s2[p + 1])
		p++;
	nxt[1] = p;
	for (int i = 2; i < m; i++) {
		p = k + nxt[k] - 1;
		int l = nxt[i - k];
		if(i + l <= p)
			nxt[i] = l;
		else {
			int j = max(0, p - i + 1);
			while(i + j < m && s2[i + j] == s2[j])
				j++;
			nxt[i] = j;
			k = i;
		}
	} 
}
long long ans1 = 0, ans2 = 0;
int main() {
	cin >> s2;
	m = s2.size();
	solve1();
	for (int i = 0; i < m; i++)
		cout << nxt[i] << " ";
	return 0;
}