#include <iostream>
#include <cstring>
#include <string>  
using namespace std;  
void solve(const string& s) {  
    int n = s.size(), len = 0, i = 1, lps[n];
    while (i < n) {  
        if (s[i] == s[len]) {  
            len++;  
            lps[i] = len;  
            i++;  
        }
		else {
            if (len != 0) len = lps[len - 1];
			else { 
                lps[i] = 0;  
                i++;  
            }  
        }  
    }
  	for (int k = 0; k < n; k ++ ) {
  		if ((k + 1) / 2 < lps[k]) {
  			if ((k + 1) % 2 != 0) lps[k] /= 2;
  			else lps[k] = 0;
		}
  		else if((k + 1) / 2 == lps[k])
  			if ((k + 1) % 2 == 0)
  				lps[k] = 0;
  	}
  	bool flag = true;
  	for (int k = 0; k < s.size() - 1; k ++ )
  		if (s[k] != s[k + 1])
  			flag = false;
	if (flag) {
		for (int k = 0; k < s.size(); k ++ ) cout << k / 2 << " ";
		return;
	}
  	for (int k = 0 ;k < n; k ++ ) cout << lps[k] << " " ;
}  
string s;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0); 
    cin >> s;  
    solve(s);
    cout << "\n";  
    return 0;  
}