#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define N 2222222
#define base 1000000093
#define mod 1234429061
int n, nxt[N][24];
ll h[33333], p[33333] = {1};
char s[N];
bool cmp(int l, int r, int x, int y){
	if(x <= r)
		return false;
	for(int i = l, j = x ; i <= r ; i++, j++)
		if(s[i] != s[j])
			return false;
	return true;
}
ll calc(ll l, ll r){
	return ((h[r] - h[l - 1] * p[r - l + 1] % mod) % mod + mod) % mod;
}
void debug(int l, int r){
	cerr << "\n" << l << " " << r << " " << calc(l, r) << "\n";
}
bool check(int tot, int len){
	//debug(1, len);
	//debug(tot - len + 1, tot);
	return calc(1, len) == calc(tot - len + 1, tot);
}
int main(){
	scanf("%s", s + 1);
	n = strlen(s + 1);
	if(n <= 100){
		for(int i = 1 ; i <= n ; i++)
			for(int len = (i - 1) / 2 ; len >= 0 ; len--){
				if(cmp(1, len, i - len + 1, i)){
					printf("%d ", len);
					break;
				}
			}
		return 0;
	}
	if(n <= 3000){
		for(int i = 1 ; i <= n ; i++){
			h[i] = (h[i - 1] * base + s[i]) % mod;
			p[i] = p[i - 1] * base % mod;
		}
		for(int i = 1 ; i <= n ; i++){
			int l = 0, r = ((i - 1) >> 1);
			for(int j = r ; j >= l ; j--){
				if(check(i, j)){
					printf("%d ", j);
					break;
				}
			}
		}
		return 0;
	}
	for(int i = 2 ; i <= n ; i++){
		int x = nxt[i - 1][0];
		while(x && s[x + 1] != s[i]){
			x = nxt[x][0];
		}
		if(s[i] == s[x + 1])
			nxt[i][0] = (x + 1);
		else
			nxt[i][0] = 0;
		if(n <= 2000000){
			for(int j = 1 ; j <= __lg(i) ; j++){
				nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
			}
		}
	}
	if(n <= 2000000){
		for(int i = 1 ; i <= n ; i++){
			int t = i;
			for(int j = __lg(i) ; j >= 0 ; j--)
				if(nxt[t][j] > ((i - 1) >> 1))
					t = nxt[t][j];
			printf("%d ", nxt[t][0]);
		}
		return 0;
	}
	return 0;
}