#include <bits/stdc++.h>
#define rfor(i,l,r) for(int i=l;i<=r;i++)
#define irfor(i,r,l) for(int i=r;i>=l;i--)
#define y0 qwertyuiopsdfghjqesg
#define x0 ashgjshdfslhgsldkfhg
#define y1 serghaporitsdfvbsgar
#define mkp make_pair
#define ls(p) p<<1
#define rs(p) p<<1|1
using namespace std;
typedef long long ll;typedef unsigned long long ull;typedef pair<int,int> pii;
inline ll read()
{
	ll x=0,f=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=x*10+c-48;c=getchar();}
	return x+f;
}
inline ll qpow(ll a,ll b,ll p){ll ans=1;while(b){if(b&1)ans=ans*a%p;a=a*a%p;b>>=1;}return ans;}
inline void gmin(int &a,int b){if(b<a)a=b;}inline void gmax(int &a,int b){if(b>a)a=b;}
inline int min(int a,int b){return a<b?a:b;}inline int max(int a,int b){return a>b?a:b;}
inline void gmin(ll &a,ll b){if(b<a)a=b;}inline void gmax(ll &a,ll b){if(b>a)a=b;}
inline ll min(ll a,ll b){return a<b?a:b;}inline ll max(ll a,ll b){return a>b?a:b;}
const int N = 1e5+5,mod = 1e9+7;
int n,pi[N];
char s[N];
int main()
{
	cin >> s+1;
	n = strlen(s+1);
	int i = 1,j = 0;pi[0] = -1;
	while(i <= n)
	{
		if(j == 0 || s[j]==s[i]) pi[i++] = j++;
		else j = pi[j-1]+1;
	}
	rfor(i,1,n) cout << pi[i] << ' ';
	return 0;
}