#include <bits/stdc++.h>

#define endl '\n'
#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
#define DEBUG_FMT(...) { cerr << "* "; fprintf(stderr, __VA_ARGS__); }

using namespace std;
using LL = long long;

const int N = 3e5+5;

struct Node
{
	int len, fa;
	int ch[26];
}t[3*N];

int tot = 1, las = 1;
int endpos[3*N];

void extend(int c)
{
	int p = las, np = las = ++tot;
	t[np].len = t[p].len+1;
	for(; p && !t[p].ch[c]; p = t[p].fa) 
		t[p].ch[c] = np;

	if(!p) t[np].fa = 1;
	else {
		int q = t[p].ch[c];
		if(t[q].len == t[p].len+1) t[np].fa = q;
		else {
			int nq = ++tot;
			t[nq] = t[q]; t[nq].len = t[p].len+1;
			t[q].fa = t[np].fa = nq;
			for(; p && t[p].ch[c] == q; p = t[p].fa) 
				t[p].ch[c] = nq;
		}
	}
}

int n;

char str[N];
int s[N][26];

vector<int> e[3*N];

LL ans = 0;
void dfs(int x)
{
	for(int y : e[x]) {
		dfs(y);
		if(!endpos[x]) 
			endpos[x] = endpos[y];
	}

	if(x == 1) return;
	int l = endpos[x]-t[x].len+1, r = endpos[x]-t[t[x].fa].len;
	// if(r == endpos[x]) r--;
	for(int i = 0; i < 26; i++) {
		if(!t[x].ch[i]) continue;
		int delta = s[r-1][i]-s[l-1][i];
		if(delta <= 0) continue;
		ans += delta;
		// DEBUG_FMT("endpos = %d, char = %c, [%d, %d], +%d\n", endpos[x], 'a'+i, l, r, delta);
	}
	int c = str[r]-'a';
	if(t[t[x].fa].ch[c]) {
		ans++;
	}	
}

int main()
{
	// freopen("1.in", "r", stdin);

	scanf(" %s", str+1);
	n = strlen(str+1);

	for(int i = 1; i <= n; i++) {
		int c = str[i]-'a';
		extend(c);
		memcpy(s[i], s[i-1], sizeof s[i]);
		s[i][c]++;
	}

	int cur = 1;
	for(int i = 1; i <= n; i++) {
		int c = str[i]-'a';
		cur = t[cur].ch[c];
		endpos[cur] = i;
	}

	for(int i = tot; i > 1; i--) {
		int y = t[i].fa;
		e[y].push_back(i);
	}

	dfs(1);

	// for(int i = 0; i < 26; i++) 
	// 	if(s[n][i]) ans++;

	cout << ans << endl;
	return 0;
}