// bzoj1396#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>#include<map>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=100010;struct Segtree {int l,r,s,tag;}tr[maxn<<2];int sa[maxn],height[maxn],rank[maxn];char s[maxn];namespace Suffix {	int wa[maxn],wb[maxn],ww[maxn];	bool cmp(int *r,int a,int b,int l) {		return r[a]==r[b] && r[a+l]==r[b+l];	}	void da(char *r,int *sa,int n,int m) {		int i,j,p,*x=wa,*y=wb;		for (i=0;i<=m;i++) ww[i]=0;		for (i=1;i<=n;i++) ww[x[i]=r[i]]++;		for (i=1;i<=m;i++) ww[i]+=ww[i-1];		for (i=n;i>=1;i--) sa[ww[x[i]]--]=i;		for (p=0,j=1;p<n;j*=2,m=p) {			for (p=0,i=n-j+1;i<=n;i++) y[++p]=i;			for (i=1;i<=n;i++) if (sa[i]>j) y[++p]=sa[i]-j;			for (i=0;i<=m;i++) ww[i]=0;			for (i=1;i<=n;i++) ww[x[y[i]]]++;			for (i=1;i<=m;i++) ww[i]+=ww[i-1];			for (i=n;i>=1;i--) sa[ww[x[y[i]]]--]=y[i];			for (swap(x,y),p=x[sa[1]]=1,i=2;i<=n;i++)				x[sa[i]]=cmp(y,sa[i-1],sa[i],j) ? p : ++p;		}	}	void calheight(char *r,int *sa,int n) {		for (int i=1;i<=n;i++) rank[sa[i]]=i;		for (int k=0,i=1;i<=n;i++) {			if (k) k--;			int j=sa[rank[i]-1];			while (r[i+k]==r[j+k]) k++;			height[rank[i]]=k;		}	}}namespace SegTree {	void build(int k,int s,int t) {		tr[k].l=s,tr[k].r=t;		if (s==t) {tr[k].s=inf;return;}		int mid=(s+t)>>1;		if (s<=mid) build(k<<1,s,mid);		if (mid<t) build(k<<1|1,mid+1,t);		tr[k].s=min(tr[k<<1].s,tr[k<<1|1].s);	}	void pushdown(int k) {		int x=tr[k].tag;tr[k].tag=0;		if (x<tr[k<<1].s) tr[k<<1].s=tr[k<<1].tag=x;		if (x<tr[k<<1|1].s) tr[k<<1|1].s=tr[k<<1|1].tag=x;	}	void update(int k,int s,int t,int val) {		int l=tr[k].l,r=tr[k].r,mid=(l+r)>>1;		if (l==s && r==t) {if (tr[k].s>val) tr[k].s=tr[k].tag=val;return;}		if (tr[k].tag) pushdown(k);		if (t<=mid) update(k<<1,s,t,val);		else if (s>mid) update(k<<1|1,s,t,val);		else update(k<<1,s,mid,val),update(k<<1|1,mid+1,t,val);		tr[k].s=max(tr[k<<1].s,tr[k<<1|1].s);	}	int query(int k,int p) {		int l=tr[k].l,r=tr[k].r,mid=(l+r)>>1;		if (l==r && l==p) return tr[k].s;		if (p<=mid) return query(k<<1,p);		else return query(k<<1|1,p);	}}int main() {	using namespace Suffix;	using namespace SegTree;	scanf("%s",s+1);	int n=strlen(s+1);	da(s,sa,n,300);	calheight(s,sa,n);	build(1,1,n);	for (int i=1;i<=n;i++) {		int val=max(height[rank[i]],height[rank[i]+1]);		if (val==n-i+1) continue;		update(1,i,i+val,val+1);	}	for (int i=1;i<=n/2;i++) swap(s[i],s[n-i+1]);	da(s,sa,n,300);	calheight(s,sa,n);	for (int i=1;i<=n;i++) {		int val=max(height[rank[i]],height[rank[i]+1]);		if (val==n-i+1) continue;		update(1,n-(i+val)+1,n-i+1,val+1);	}	for (int i=1;i<=n;i++) printf("%d\n",min(n,query(1,i)));	return 0;}