#include<bits/stdc++.h>
using i64 = long long;
int read(){
	int x = 0, f = 1, c = getchar();
	while(!isdigit(c)){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(isdigit(c)){
		x = x * 10 + (c ^ 48);
		c = getchar();
	}
	return x * f;
}
const int N = 2e6 + 10;
std::string a, b, tot;
int nxt[N];
void KMP(std::string s, int siz){
	memset(nxt, -1, sizeof nxt);
	for(int i = 1, j = -1; i < siz; i ++){
		while(s[i] != s[j + 1] && j != -1){
			j = nxt[j];
		}
		if(s[i] == s[j + 1]){
			j ++;
		}
		nxt[i] = j;
	}
}
void solve(){
	std::cin >> a;
	KMP(a,a.size());
	for(int i = 0; i < a.size(); i ++){
		std::cout << nxt[i] + 1 << " ";
	}
}
signed main(){
	solve();
	return 0;
}