// Problem: 1. 前缀函数 / KMP
// URL: https://qoj.ac/contest/1536/problem/464
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Start: 2024-11-23 17:17:48

#include <iostream>
#include <string>
#include <vector>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

std::vector<int> KMP(const std::string &s) { // 前缀函数
  int n = s.size();
  std::vector<int> f(n + 1);
  for (int i = 1, j = 0; i < n; i++) {
    while (j && s[i] != s[j]) {
      j = f[j];
    }
    j += (s[i] == s[j]);
    f[i + 1] = j;
  }
  return f;
}

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  std::string s;
  std::cin >> s;
  auto pi(KMP(s));
  for (int i = 1; i < pi.size(); i++) {
    std::cout << pi[i] << " \n"[i == pi.size() - 1];
  }

  return 0;
}