#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <queue>
typedef long long LL;
using namespace std;
inline int read() {
	int num = 0 ,f = 1; char c = getchar();
	while (!isdigit(c)) f = c == '-' ? -1 : f ,c = getchar();
	while (isdigit(c)) num = (num << 1) + (num << 3) + (c ^ 48) ,c = getchar();
	return num * f;
}
const int N = 1e5 + 5;
int nex[N];
inline void fuling_kmp(char S[] ,int n) {
	nex[1] = 0;
	for (int i = 2 ,j = 0; i <= n; i++) {
		while (j && S[i] != S[j + 1]) j = nex[j];
		if (S[i] == S[j + 1]) j++;
		nex[i] = j;
	}
}
char str[N];
inline void fuling_solve() {
	scanf("%s" ,str + 1);
	int n = strlen(str + 1);
	fuling_kmp(str ,n);
	for (int i = 1; i <= n; i++) printf("%d%c" ,nex[i] ," \n"[i == n]);
}
signed main() {
	int t = 1;
	while (t--) fuling_solve();
	return 0;
}