1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #define N (200000+1000)
 5 using namespace std;
 6
 7 char s[N];
 8 int Ans,n;
 9
10 struct SGT
11 {
12     int Segt[N<<1];
13     SGT(){memset(Segt,0x7f,sizeof(Segt));}
14
15     void Update(int now,int l,int r,int l1,int r1,int k)
16     {
17         if (r<l1 || l>r1) return;
18         if (l1<=l && r<=r1){Segt[now]=min(Segt[now],k);return;}
19         int mid=(l+r)>>1;
20         Update(now<<1,l,mid,l1,r1,k); Update(now<<1|1,mid+1,r,l1,r1,k);
21     }
22     void Query(int now,int l,int r,int x)
23     {
24         Ans=min(Ans,Segt[now]);
25         if (l==r) return;
26         int mid=(l+r)>>1;
27         if (x<=mid) Query(now<<1,l,mid,x);
28         else Query(now<<1|1,mid+1,r,x);
29     }
30 }SGT[2];
31
32 struct SAM
33 {
34     int fa[N],son[N][28],right[N],step[N],End[N],od[N],wt[N];
35     int p,q,np,nq,last,cnt;
36     SAM(){last=++cnt;}
37
38     void Insert(int x,int pos)
39     {
40         p=last; last=np=++cnt; step[np]=step[p]+1; right[np]=1; End[np]=pos;
41         while (p && !son[p][x]) son[p][x]=np,p=fa[p];
42         if (!p) fa[np]=1;
43         else
44         {
45             q=son[p][x];
46             if (step[p]+1==step[q]) fa[np]=q;
47             else
48             {
49                 nq=++cnt; step[nq]=step[p]+1;
50                 memcpy(son[nq],son[q],sizeof(son[q]));
51                 fa[nq]=fa[q]; fa[q]=fa[np]=nq;
52                 while (son[p][x]==q) son[p][x]=nq,p=fa[p];
53             }
54         }
55     }
56     void Init()
57     {
58         int len=strlen(s+1);
59         for (int i=1; i<=cnt; ++i) wt[step[i]]++;
60         for (int i=1; i<=len; ++i) wt[i]+=wt[i-1];
61         for (int i=cnt; i>=1; --i) od[wt[step[i]]--]=i;
62         for (int i=cnt; i>=1; --i) right[fa[od[i]]]+=right[od[i]];
63     }
64     void Solve()
65     {
66         for (int i=1; i<=cnt; ++i)
67         if (right[i]==1)
68         {
69             SGT[0].Update(1,1,n,End[i]-step[i]+1,End[i]-step[fa[i]],End[i]+1);
70             SGT[1].Update(1,1,n,End[i]-step[fa[i]],End[i],step[fa[i]]+1);
71         }
72         for (int i=1; i<=n; ++i)
73         {
74             Ans=0x7fffffff;
75             SGT[0].Query(1,1,n,i); Ans-=i;
76             SGT[1].Query(1,1,n,i);
77             printf("%d\n",Ans);
78         }
79     }
80 }SAM;
81
82 int main()
83 {
84     scanf("%s",s+1);
85     n=strlen(s+1);
86     for (int i=1; i<=n; ++i)
87         SAM.Insert(s[i]-'a',i);
88     SAM.Init();
89     SAM.Solve();
90 }