#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <cstring>
#include <vector>
#include <bitset>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 6e5;

char s[N + 5];
int p, q, np = 1, nq, ch[N + 5][26], ds = 1, cd, len[N + 5], fa[N + 5], id[N + 5], n;
std::vector<int> Vec[N + 5];
int sum[N + 5][26], pos[N + 5];
bool vis[N + 5][26];
long long ans;

void ins(int zf) {
    p = np, len[np = ++ds] = ++cd;
    id[np] = cd;
    while (!ch[p][zf] && p) {
        ch[p][zf] = np;
        p = fa[p];
    }
    if (!p) {
        fa[np] = 1;
        return;
    }
    q = ch[p][zf];
    if (len[q] == len[p] + 1) {
        fa[np] = q;
        return;
    }
    len[nq = ++ds] = len[p] + 1;
    memcpy(ch[nq], ch[q], sizeof(ch[q]));
    fa[nq] = fa[q];
    fa[np] = fa[q] = nq;
    ch[p][zf] = nq;
    while (ch[p = fa[p]][zf] == q) ch[p][zf] = nq;
}

void dfs(int u) {
    if (id[u]) {
        pos[u] = id[u];
        if (id[u] < n) vis[u][s[id[u] + 1] - 'a'] = true;
    }
    for (int v : Vec[u]) {
        dfs(v);
        for (int i = 0; i < 26; ++i) vis[u][i] |= vis[v][i];
        if (!pos[u]) pos[u] = pos[v];
    }
    if (u > 1) {
        int l = len[fa[u]] + 1, r = len[u];
        for (int i = 0; i < 26; ++i)  {
            if (sum[pos[u] - l][i] - sum[pos[u] - r][i] > 0 && vis[u][i]) ans += sum[pos[u] - l][i] - sum[pos[u] - r][i];
        }
        for (int v : Vec[u]) {
            if (vis[u][s[pos[v] - len[u]] - 'a']) ++ans;
        }
    }
    // printf("%d %lld\n", u, ans);
}

int main() {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    for (int i = 1; i <= n; ++i) {
        ins(s[i] - 'a');
        for (int j = 0; j < 26; ++j) sum[i][j] = sum[i - 1][j];
        ++sum[i][s[i] - 'a'];
    }
    // for (int i = 2; i <= ds; ++i) printf("%d\n", fa[i]);
    for (int i = 2; i <= ds; ++i) Vec[fa[i]].push_back(i);
    dfs(1);
    for (int i = 0; i < 26; ++i)
        if (sum[n][i]) ++ans;
    printf("%lld\n", ans);
    return 0;
}