#include <bits/stdc++.h>
#define LL long long
#define sl(n) strlen(n)
#define endline puts("")
#define pii pair<int , int>
#define pr_q priority_queue
#define debug puts("DEBUG.")
using namespace std;
const int N = 1e5 + 10;
const int inf = ~0u >> 2;
char s[N];
int nxt[N];
int main()
{
	scanf("%s" , s);
	int n = sl(s);
	int pos = 0,mx = -1;
	for(int i = 1;i < n;i++)
	{
		if(mx < i)
		{
			int res = 0;
			while( s[res] == s[i + res] )
				++res;
			nxt[i] = res;
			if(i + nxt[i] - 1 > mx)
				mx = i + nxt[i] - 1,pos = i;
			continue;
		}
		int j = i - pos;
		if(nxt[j] >= mx - i + 1)
		{
			int res = mx - i + 1;
			while( s[res] == s[i + res] )
				++res;
			nxt[i] = res;
			if(i + nxt[i] - 1 > mx)
				mx = i + nxt[i] - 1,pos = i;
			continue;
		}
		nxt[i] = nxt[j];
	}
	for(int i = 0;i < n;i++)
		printf( "%d " , nxt[i] );
	endline;
	return 0;
}