#include <bits/stdc++.h>

using namespace std;

vector<int> KMP(string s) // 最长的相等的真前缀与真后缀的长度
{
    int n = (int)s.size();
    vector<int> pi(n);
    for (int i = 1; i < n; i++) {
        int j = pi[i - 1];
        while (j > 0 && s[i] != s[j]) j = pi[j - 1];
        if (s[i] == s[j]) j++;
        pi[i] = j;
    }
    return pi;
}

void solve() {
    string s;
    cin >> s;
    auto a = KMP(s);
    for (int x : a) cout << x << " "; cout << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int T = 1;
    while (T--) solve();
    return 0;
}