#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<=(m);i++)
#define ROF(i,n,m) for(int i=(n);i>=(m);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define SZ(v) v.size()
#define pb push_back
template < typename A , typename B>
inline bool chmax(A &x, B y) { return (x < y ? (x = y, true) : false); }
template < typename A , typename B>
inline bool chmin(A &x, B y) { return (x > y ? (x = y, true) : false); }
const int N = 1e5 + 5;
int n, p[N];
string s;
void solve() {
	cin >> s; n = SZ(s); s = ' ' + s;
	FOR(i, 2, n) {
		int j = p[i - 1];
		while(j && s[j + 1] != s[i]) j = p[j];
		if(s[j + 1] == s[i]) j++;
		p[i] = j;
	}
	FOR(i, 1, n) cout << p[i] << " ";
	cout << endl;
}
int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	solve();
	return 0;
}