#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define rz resize
#define Siz(a) (int)(a.size())
#define MP make_pair
#define MT make_tuple
#define IT iterator
#define fi first
#define se second
#define For(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define Rep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define CLR(a, v) memset(a, v, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(a))
#define debug cerr << "ztxakking\n"
#define y0 ztxaknoi
#define y1 ztxakioi
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using i128 = __int128_t;
using u128 = __uint128_t;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using vi = vector<int>;
template<typename T>
using V = vector<T>;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 7;
int n, nxt[N];
string s;
void Main() {
  cin >> s, n = s.size(), s = ' ' + s;
  for (int i = 2, p = 0; i <= n; ++i) {
    while (p && s[p + 1] != s[i]) p = nxt[p];
    if (s[p + 1] == s[i]) ++p;
    nxt[i] = p;
  }
  For(i, 1, n) cout << nxt[i] << ' ';
  cout << '\n';
}
int main() {
  #ifndef ONLINE_JUDGE
  freopen("1.in", "r", stdin) && freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  // cin >> t;
  while (t--) Main();
  cerr << (double)(clock()) / CLOCKS_PER_SEC << '\n';
  return 0;
}