// Problem: 1. 前缀函数 / KMP
// URL: https://qoj.ac/contest/1536/problem/464
// Writer: WRuperD
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 1e5 + 10;

int nxt[MAX];

void solve(){
	string s;
	cin>>s;
	int n = s.length();
	s = " " + s;
	int j = 0;
	for(int i = 2; i <= n; i++){
		while(s[j + 1] != s[i] and j)	j = nxt[j];
		if(s[j + 1] == s[i])	j++;
		nxt[i] = j;
	}
	for(int i = 1; i <= n; i++)	write(nxt[i]), put();
	endl;
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}