#if defined(LOCAL)
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif

#include <bits/stdc++.h>

#if defined(LOCAL)
#define DBG_MACRO_NO_WARNING
#include <dbg.hpp>
#else
#define dbg(x...) (0)
#endif

using namespace std;

using ll = long long;

// #define int ll
#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)
#define re(i, t) rep (i, 1, t)
#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)
#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)
#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)
#define umod(x) ((x) >= mo && ((x) -= mo))
#define dmod(x) ((x) < 0 && ((x) += mo))
#define y1 y1__
#define fio(x) (freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout))

template <class T, class E>
__attribute__((always_inline)) inline void up(T &x, E &&y) {
  if (x < y) x = y;
}
template <class T, class E>
__attribute__((always_inline)) inline void down(T &x, E &&y) {
  if (y < x) x = y;
}

const int N = 1e6 + 9;
int n2, fil[N];
char s2[N];

signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  {
    string s2_;
    cin >> s2_;
    strcpy(s2 + 1, s2_.c_str());
    n2 = strlen(s2 + 1);
  }
  int p = 0;
  rep (i, 2, n2) {
    while (p && s2[p + 1] != s2[i]) p = fil[p];
    if (s2[p + 1] == s2[i]) ++p;
    fil[i] = p;
  }
  re (i, n2) cout << fil[i] << " \n"[i == edi];
  return 0;
}