#include <bits/stdc++.h>
// #define int long long
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define tii tuple<int, int, int>
#define db double
#define all(a) a.begin(), a.end()
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 998244353;
int nxt[maxn];
void getnxt(string str) {  // 得到str的next数组，next数组为对应位置的最长border
    nxt[0] = 0;
    for (int i = 1, j = 0; i < str.length(); i++) {
        while (j && str[i] != str[j])
            j = nxt[j - 1];
        if (str[i] == str[j])
            j++;
        nxt[i] = j;
    }
}
void solve() {
    string str; cin >> str;
    getnxt(str);
    for (int i = 0; i < str.length(); i++)
        cout << nxt[i] << " ";
}
signed main() {
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}