// Author: Klay Thompson
// Problem: 1. 前缀函数 / KMP
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 100010;

int n, fail[maxn];
char s[maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> (s + 1), n = strlen(s + 1);
  rep (i, 2, n) {
    int j = fail[i - 1];
    while (j && s[i] != s[j + 1]) j = fail[j];
    fail[i] = (s[i] == s[j + 1] ? j + 1 : j);
  }
  rep (i, 1, n) cout << fail[i] << " \n"[i == n];
}