#include<bits/stdc++.h>
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
struct mint{
    int x;mint(int o=0){x=o;}mint&operator+=(mint a){return(x+=a.x)%=mod,*this;}mint&operator-=(mint a){return(x+=mod-a.x)%=mod,*this;}
    mint&operator*=(mint a){return(x=1ll*x*a.x%mod),*this;}mint&operator^=( int b){mint a=*this;x=1;while(b)(b&1)&&(*this*=a,1),a*=a,b>>=1;return*this;}
    mint&operator/=(mint a){return*this*=(a^=mod-2);}friend mint operator+(mint a,mint b){return a+=b;}friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}friend mint operator/(mint a,mint b){return a/=b;}friend mint operator^(mint a,int b){return a^=b;}
    mint operator-(){return 0-*this;}bool operator==(const mint b)const{return x==b.x;}
};
char s[2000005];
int rt[2000005];
int n;
int nxt[2000005];
void write(int x){
	if(x<10){putchar(x+'0');return;}
	write(x/10);
	putchar(x%10+'0');
}
struct node{
	int ls,rs;
	int mx;
}seg[2000005*30];
int tot;
void upd(int &x,int y,int l,int r,int p){
	x=++tot;
	seg[x]=seg[y];
	if(l==r){seg[x].mx=p;return;}
	int mid=(l+r)/2;
	if(p<=mid)upd(seg[x].ls,seg[y].ls,l,mid,p);
	else upd(seg[x].rs,seg[y].rs,mid+1,r,p);
	if(seg[seg[x].rs].mx)seg[x].mx=seg[seg[x].rs].mx;
	else seg[x].mx=seg[seg[x].ls].mx;
}
int query(int x,int l,int r,int ql,int qr){
	if(l==ql&&r==qr)return seg[x].mx;
	int mid=(l+r)/2;
	if(qr<=mid)return query(seg[x].ls,l,mid,ql,qr);
	else if(ql>mid)return query(seg[x].rs,mid+1,r,ql,qr);
	int v=query(seg[x].rs,mid+1,r,mid+1,qr);
	if(v)return v;
	return query(seg[x].ls,l,mid,ql,mid);
}
signed main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	for(int i=2;i<=n;i++){
		int b=nxt[i-1];
		while(s[i]!=s[b+1]){
			if(b==nxt[b])break;
			b=nxt[b];
		}
		if(s[i]!=s[b+1]){nxt[i]=0;continue;}
		nxt[i]=b+1;
	}
	for(int i=1;i<=n;i++){
		upd(rt[i],rt[nxt[i]],0,n,nxt[i]);
		write(query(rt[i],0,n,0,(i-1)/2));
		putchar(' ');
		//最大的 <=(i-1)/2
	}
	return 0;
}