#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 8e5 + 7;
int n;
char s[N]; 

int ch[N][26], len[N], fa[N], tot = 1, lst = 1;
void cpy(int x, int y) {
	len[y] = len[x], fa[y] = fa[x];
	L(i, 0, 25) ch[y][i] = ch[x][i];
}
void ins(int x) {
	int p = lst, now = lst = ++tot;
	len[now] = len[p] + 1;
	for(; p && !ch[p][x]; p = fa[p]) ch[p][x] = now;
	if(!p) fa[now] = 1;
	else {
		int pto = ch[p][x];
		if(len[pto] == len[p] + 1) fa[now] = pto;
		else {
			int sp = ++tot;
			cpy(pto, sp), len[sp] = len[p] + 1;
			fa[now] = fa[pto] = sp;
			for(; p && ch[p][x] == pto; p = fa[p]) ch[p][x] = sp;
		}
	}
} 

vector < pair < int, int > > prs[N];
vi e[N];

void merge(int x, int y) {
	if(sz(prs[x]) < sz(prs[y])) 
		swap(prs[x], prs[y]);
}

int lw[N];
int f[N], ftot;
struct lct {
	int fa[N], ch[N][2], siz[N], tag[N];
	ll s[N], sum[N];
	bool get(int x) {
		return ch[fa[x]][0] == x || ch[fa[x]][1] == x;
	}
	void upd(int x) {
		siz[x] = siz[ch[x][0]] + siz[ch[x][1]] + lw[x];
		sum[x] = s[x] + sum[ch[x][0]] + sum[ch[x][1]];
	}
	void AD(int x, int y) {
		if(x) tag[x] += y, s[x] += (ll) y * lw[x], sum[x] += (ll) y * siz[x];
	}
	void pushdown(int x) {
		if(tag[x]) AD(ch[x][0], tag[x]), AD(ch[x][1], tag[x]), tag[x] = 0;
	}
	void rotate(int x) {
		int y = fa[x], z = fa[y], fson = (ch[y][1] == x), ano = ch[x][fson ^ 1];
		if(get(y)) ch[z][ch[z][1] == y] = x; 
		if(ano) fa[ano] = y;
		fa[x] = z, fa[y] = x, ch[x][fson ^ 1] = y, ch[y][fson] = ano;
		upd(y), upd(x);
	}
	void splay(int x) {
		int fx = x; f[++ftot] = x;
		while(get(fx)) fx = f[++ftot] = fa[fx];
		while(ftot) pushdown(f[ftot--]);
		while(get(x)) {
			int y = fa[x], z = fa[y];
			if(get(y)) rotate((ch[y][1] == x) ^ (ch[z][1] == y) ? x : y);
			rotate(x);
		} 
	}
	void access(int x) {
		for(int y = 0; x; y = x, x = fa[x]) splay(x), ch[x][1] = y, upd(x);	
	}
	void insert(int x) {
		access(x), splay(x), AD(x, 1);
	}
	ll query(int x) {
		access(x), splay(x);
		return sum[x];
	}
} lct[27];

int cnt[N];
void insert(int x, int y) {
	++x;
	for(; x <= 26; x += x & -x) lct[x].insert(y);
}

ll query(int x, int y) {
	ll ret = 0;
	for(; x; x -= x & -x) ret += lct[x].query(y);
	return ret;
}

int pl[N], pr[N];
ll ns;

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> (s + 1), n = strlen(s + 1);
	lst = 1;
	L(i, 1, n) ins(s[i] - 'a');
	lst = 1;
	R(i, n, 1) ins(s[i] - 'a');
	pl[0] = pr[n + 1] = 1;
	L(i, 1, n) pl[i] = ch[pl[i - 1]][s[i] - 'a'];
	R(i, n, 1) pr[i] = ch[pr[i + 1]][s[i] - 'a'];
	L(i, 2, n) prs[pl[i - 1]].push_back({s[i] - 'a', i});
	L(i, 1, n - 1) prs[pr[i + 1]].push_back({s[i] - 'a', i});
	L(i, 1, tot) lw[i] = len[i] - len[fa[i]];
	lw[1] = 1;
	L(i, 1, 26) L(j, 1, tot) lct[i].fa[j] = fa[j];
	R(i, n, 1) {
		ns += query(s[i] - 'a', pl[i - 1]);
		insert(s[i] - 'a', pr[i + 1]);
	}
	cout << ns << '\n';
	return 0;
}