#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 1e5 + 5;

int n, p[N];
char s[N];

void solve() {
	cin >> (s + 1), n = strlen(s + 1);
	p[1] = 0;
	int j = 0;
	F (i, 2, n) {
		while (j && s[j + 1] != s[i]) j = p[j];
		if (s[j + 1] == s[i]) j++;
		p[i] = j;
	}
	F (i, 1, n) {
		cout << p[i] << ' ';
	}
}

bool Med;
int main() {
	// FIO("");
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}