#include<bits/stdc++.h>
#define N 300005
#define re 
#define ll long long
using namespace std;
int n,m,k,q,T;
inline void Rd(int &res){
	re char c;res=0;
	while(c=getchar(),c<48);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
}
char s[N];
ll ans;
struct SAM{
	int n,maxlen[N<<1],trans[N<<1][26],slink[N<<1],u,pos[N<<1];
	void clear(){memset(trans[0],0,sizeof(trans[0]));slink[0]=-1;n=0;u=0;}
	void add(char ch,int pos0){
		int z=++n,c=ch-'a';maxlen[z]=maxlen[u]+1;
		pos[z]=pos0;
		while(u!=-1&&!trans[u][c])trans[u][c]=z,u=slink[u];
		if(u==-1){slink[z]=0,u=z;return;}
		int x=trans[u][c];
		if(maxlen[u]+1==maxlen[x]){slink[z]=x;u=z;return;}
		int y=++n;maxlen[y]=maxlen[u]+1,slink[y]=slink[x];pos[y]=pos[x];
		for(re int i=0;i<26;i++)trans[y][i]=trans[x][i];
		slink[x]=y;slink[z]=y;
		while(u!=-1&&trans[u][c]==x)trans[u][c]=y,u=slink[u];
		u=z;
	}
	void Solve(){
		for(re int i=n;i>=1;i--){
			for(re int j=maxlen[slink[i]]+2;j<=maxlen[i];j++)
				ans+=!!trans[i][s[pos[i]-j+1]-'a'];
			ans+=!!trans[slink[i]][ s[pos[i]-maxlen[slink[i]] ]-'a' ];
		}
	}
}S;

int main(){
	scanf("%s",s+1);
	n=strlen(s+1);	
	S.slink[0]=-1;
	for(re int i=1;i<=n;i++)S.add(s[i],i);
	S.Solve();
	printf("%lld\n",ans);
	
	
	
	
	
	return 0;
}