#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
const int MAXN=3e6+5;
int n,lcp[MAXN];char s[MAXN];
void exkmp(){
	for(int i=2,l=0,r=0;i<=n;i++){
		if(i<=r) lcp[i]=min(lcp[i-l+1],r-i+1);
		while(i+lcp[i]<=n&&s[lcp[i]+1]==s[i+lcp[i]]) lcp[i]++;
		if(i+lcp[i]-1>r) l=i,r=i+lcp[i]-1;
	}
}
bool chkmin(int x,int y,int r){// return s[x:r]+s[1:x-1]<s[y:r]+s[1+y-1]
	x=(x+r-y)+1;y=1;
	if(lcp[x]<r-x+1) return s[x+lcp[x]]<s[lcp[x]+1];
	y=(y+r-x)+1;
	if(lcp[y]<r-y+1) return s[lcp[y]+1]<s[y+lcp[y]];
	return true;
}
int main(){
	ios::sync_with_stdio(false);
	// freopen("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	cin>>s+1;n=strlen(s+1);
	exkmp();
	vector<int> cur,nxt;
	for(int i=1;i<=n;i++){
		cur.push_back(i);nxt.clear();
		for(int j:cur){
			bool flag=true;
			while(!nxt.empty()){
				int k=nxt.back();
				if(s[i-j+k]==s[i]) break;
				else if(s[i-j+k]<s[i]) {flag=false;break;}
				else nxt.pop_back();
			}
			if(flag&&(nxt.empty()||i-j<=j-nxt.back())) nxt.push_back(j);
		}
		cur=nxt;int ans=cur[0];
		for(int j:cur) ans=chkmin(ans,j,i)?ans:j;
		cout<<ans<<" \n"[i==n];
	}
	return 0;
}