#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define int128 __int128
#define FOR(i, m, n) for(int i=(m);i<=(n);i++)
#define ROF(i, m, n) for(int i=(m);i>=(n);i--)
#define REP(i, n) for(int i=0;i<(n);i++)
#define BG(v) v.begin()
#define ED(v) v.end()
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) v.size()
#define FI(v) v.first
#define SE(v) v.second
#define func(v) function<v>
#define pb push_back
#define eb emplace_back
#define DFS func(void(int, int))
#define PII pair<int,int>
#define PLL pair<ll, ll> 
#define endl '\n'
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
const double EPS = 1e-8;
const int P = 998244353;
const int G = 3;
const int GI = 332748118;
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
void IOSinit() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
}
int fp(int x,int y) {
	int res = 1;
	for(;y;y >>= 1) {
		if(y & 1) res = (1ll * res * x) % P;
		x = (1ll * x * x) % P;
	}
	return res;
}
const int N = 1e5 + 5;
const int B = 331;
int n;
string s;
ull pw[N], h[N];
ull S(int l, int r) {
	return pw[n - l + 1] * (h[r] - h[l - 1]);
}
void solve() {
	cin >> s; n = SZ(s); s = ' ' + s;
	pw[0] = 1;
	FOR(i, 1, n) pw[i] = pw[i - 1] * B;
	FOR(i, 1, n) h[i] = h[i - 1] + pw[i] * s[i];
	cout << 0 << " ";
	FOR(i, 2, n) {
		int L = 1, R = n - i + 1, res = 0;
		while(L <= R) {
			int mid = L + R >> 1;
			if(S(1, mid) == S(i, i + mid - 1)) {
				res = mid;
				L = mid + 1;
			}
			else {
				R = mid - 1;
			}
		}
		cout << res << " ";
	}
	cout << endl;
}
int main() {
	IOSinit();
	solve();
	return 0;
}