#include<iostream>
#include <string.h>
#include<stdlib.h>
#define LL long long
using namespace std;
#define maxn 1020
int max(int x,int y)
{return x>y?x:y;}
int min(int x,int y)
{return x<y?x:y;}
int wa[maxn],wb[maxn],wv[maxn],WS[maxn];
int cmp(int *r,int a,int b,int l)
{return r[a]==r[b]&&r[a+l]==r[b+l];}
void da(int *r,int *sa,int n,int m)
{int i,j,p,*x=wa,*y=wb,*t;for(i=0;i<m;i++) WS[i]=0;for(i=0;i<n;i++) WS[x[i]=r[i]]++;for(i=1;i<m;i++) WS[i]+=WS[i-1];for(i=n-1;i>=0;i--) sa[--WS[x[i]]]=i;for(j=1,p=1;p<n;j*=2,m=p){for(p=0,i=n-j;i<n;i++) y[p++]=i;for(i=0;i<n;i++) if(sa[i]>=j) y[p++]=sa[i]-j;for(i=0;i<n;i++) wv[i]=x[y[i]];for(i=0;i<m;i++) WS[i]=0;for(i=0;i<n;i++) WS[wv[i]]++;for(i=1;i<m;i++) WS[i]+=WS[i-1];for(i=n-1;i>=0;i--) sa[--WS[wv[i]]]=y[i];for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;}return;
}
int Rank[maxn],height[maxn];
void calheight(int *r,int *sa,int n)
{int i,j,k=0;for(i=1;i<=n;i++) Rank[sa[i]]=i;for(i=0;i<n;height[Rank[i++]]=k)for(k?k--:0,j=sa[Rank[i]-1];r[i+k]==r[j+k];k++);return;
}
int r[maxn],sa[maxn];
char s[maxn];
int ok(int k,int n)
{int i,j,ret=0;int maxx,minx;maxx=-1;minx=9999999;for(i=1;i<=n;i++){if(height[i]>=k)//分组满足大于k的
        {maxx=max(maxx,sa[i]);minx=min(minx,sa[i]);}else {if(maxx-minx>=k)//之前满足条件就要+1；ret++;maxx=sa[i];minx=sa[i];}}if(maxx-minx>=k)ret++;return ret;
}
int main()
{int i,j;while(cin>>s){if(s[0]=='#')break;int len=strlen(s);for(i=0;i<len;i++)r[i]=s[i];r[len]=0;da(r,sa,len+1,123);calheight(r,sa,len);LL ans=0;for(i=1;i<len;i++){ans+=ok(i,len);}/*for(i=0;i<=len;i++){printf("%d %d\n",height[i],sa[i]);}*/cout<<ans<<endl;}
}