#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 3e5+5;

struct node {
	int fa,len,ch[26],pos;
} t[N*2];
int lst=1,tot=1;

void ins(int c){
	int p=lst,np=++tot;
	t[np].len=t[p].len+1;
	t[np].pos=t[p].len+1;
	lst=np;
	while (p && !t[p].ch[c]){
		t[p].ch[c]=np;
		p=t[p].fa;
	}
	if (!p){
		t[np].fa=1;
		return;
	}
	int q=t[p].ch[c];
	if (t[q].len==t[p].len+1){
		t[np].fa=q;
		return;
	}
	int nq=++tot;
	t[nq]=t[q];
	t[nq].len=t[p].len+1;
	t[q].fa=t[np].fa=nq;
	while (p && t[p].ch[c]==q){
		t[p].ch[c]=nq;
		p=t[p].fa;
	}
}

int sum[N][26];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	string s;
	cin>>s;
	int n=s.size();
	s=" "+s;
	for (int i=1; i<=n; i++){
		for (int j=0; j<26; j++) sum[i][j]=sum[i-1][j];
		sum[i][s[i]-'a']++;
		ins(s[i]-'a');
	}
	ll ans=0;
	for (int i=2; i<=tot; i++){
		for (int j=0; j<26; j++){
			if (!t[i].ch[j]) continue;
			ans+=sum[t[i].pos-t[t[i].fa].len-1][j]-sum[t[i].pos-t[i].len][j];
		}
		if (t[t[i].fa].ch[s[t[i].pos-t[t[i].fa].len]-'a']!=0) ans++;
	}
	cout<<ans<<"\n";
	return 0;
}

// TRY! TRY! TRY!

/*
Think twice before coding. Have you overkilled?
Think twice before submitting.
Check on the samples and constraints carefully.
*/

/*
Be brave to guess.
Is your former/first approach correct?
Follow your intuition.
Use a notebook to note down your ideas and check whether they are correct.
*/

/*
A simple brute force may work? There is some limit on the answer?
Try to find patterns.
*/