#include <bits/stdc++.h>

using namespace std;

// #define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 2e6 + 5;

int n;
int nxt[N], f[22][N];
string s;

int query ( int x ) {
  int maxlen = ( x & 1 ? x / 2 : x / 2 - 1 );
  for ( int i = 21; i >= 0; i -- ) {
    if ( f[i][x] > maxlen ) {
      x = f[i][x];
    }
  }
  return f[0][x];
}

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> s;
  n = s.size ();
  s = " " + s;
	for ( int i = 2, j = 0; i <= n; i ++ ) {
		while ( j && s[i] != s[j + 1] ) {
			j = nxt[j];
		}
		if ( s[i] == s[j + 1] ) {
			j ++;
		}
		nxt[i] = j;
	}
  for ( int i = 1; i <= n; i ++ ) {
    f[0][i] = nxt[i];
  }
  for ( int i = 1; i <= n; i ++ ) {
    for ( int j = 1; j <= 21; j ++ ) {
      f[j][i] = f[j - 1][f[j - 1][i]];
    }
  }
  for ( int i = 1; i <= n; i ++ ) {
    cout << query ( i ) << " ";
  }
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}