#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int N = 1e5 + 10;
constexpr int M = 2e5 + 10;
constexpr ll Mod = 998244353;
constexpr int INF = 0x3f3f3f3f;
constexpr ll Base = 131;
constexpr int MAXBIT = 30;
int pmt[N],pos[N],cnt;
void get_pmt(string& s_)
{
    memset(pmt,0,sizeof(int)*(s_.size()+5));
    for(int i=1,j=0;i<s_.size();i++)
    {
        while(j && s_[i]!=s_[j])
            j=pmt[j-1];
        if(s_[i]==s_[j])
            j++;
        pmt[i]=j;
    }
}
bool kmp(string& s_,string& p_)
{
    cnt=0;
    for(int i=0,j=0;i<s_.size();i++)
    {
        while(j && s_[i]!=p_[j])
            j=pmt[j-1];
        if(s_[i]==p_[j])
            j++;
        if(j==p_.size())
        {
            pos[++cnt]=i-j+2;
            j=pmt[j-1];
        }
    }
    return cnt;
}
void solve()
{
    string s;
    cin>>s;
    get_pmt(s);
    for(int i=0;i<s.size();i++)
        cout<<pmt[i]<<" \n"[i==s.size()];
}
int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();
    return 0;
}