#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 1e5 + 10;
string st;
int n, nxt[N];
signed main() {
	cin >> st; n = st.size(); st = ' ' + st;
	int j = 0;
	F(i, 2, n) {
		while (j && st[i] != st[j + 1]) j = nxt[j];
		if (st[i] == st[j + 1]) j++;
		nxt[i] = j;
	}
	F(i, 1, n) cout << nxt[i] << " ";
	return 0;
}