#include <bits/stdc++.h>

#define link sbsbsbs

const int N = 6e5 + 5;
const int S = 26;
char s[N];
int n;

/*
int sa[N], rk[N];
void suffixSort() {
  static int cnt[N], id[N], rk2[N], key[N];

  int m = S - 1;
  auto radixSort = [&]() {
    memset(cnt + 1, 0, m << 2);
    for (int i = 1; i <= n; i++) ++cnt[key[i]];
    for (int i = 1; i <= m; i++) cnt[i] += cnt[i - 1];
    for (int i = n; i >= 1; i--) sa[cnt[key[i]]--] = id[i];
  };
  
  for (int i = 1; i <= n; i++)
    id[i] = i, key[i] = rk[i] = s[i] - 'a';
  radixSort();

  for (int w = 1; ; w <<= 1) {
    int p = 0;
    for (int i = n; i > n - w; i--) id[++p] = i;
    for (int i = 1; i <= n; i++) if (sa[i] > w) id[++p] = sa[i] - w;
    for (int i = 1; i <= n; i++) key[i] = rk[id[i]];
    radixSort();

    auto cmp = [&](int a, int b) {
      return rk2[a] == rk2[b] && rk2[a + w] == rk2[b + w];
    };
    memcpy(rk2 + 1, rk + 1, n << 2);
    p = 1;
    rk[sa[1]] = 1;
    for (int i = 2; i <= n; i++)
      rk[sa[i]] = cmp(sa[i], sa[i - 1]) ? p : ++p;
    m = p;
    if (p == n) break;
  }
}

int height[N];
void getHeight() {
  for (int i = 1, k = 0; i <= n; i++) {
    if (rk[i] == 1) continue;
    if (k) --k;
    while (s[i + k] == s[sa[rk[i] - 1] + k]) ++k;
    height[rk[i]] = k;
  }
}
*/

int ch[N][S], link[N], len[N], epos[N], tag[N];
int total = 1, last = 1;
void extend(int c, int i) {
  int p = last, np = last = ++total;
  len[np] = len[p] + 1, epos[np] = i;
  for (; p && !ch[p][c]; p = link[p]) ch[p][c] = np;
  if (!p) { link[np] = 1; return; }
  int q = ch[p][c];
  if (len[p] + 1 == len[q]) { link[np] = q; return; }
  int nq = ++total;
  epos[nq] = epos[q];
  memcpy(ch[nq], ch[q], S << 2), link[nq] = link[q];
  len[nq] = len[p] + 1, link[np] = link[q] = nq;
  for (; p && ch[p][c] == q; p = link[p]) ch[p][c] = nq;
}

int ord[N], buc[N];
void init() {
  for (int i = 1; i <= total; i++) ++buc[len[i]];
  for (int i = 2; i <= total; i++) buc[i] += buc[i - 1];
  for (int i = 1; i <= total; i++) ord[buc[len[i]]--] = i;

  for (int i = 2; i <= total; i++) {
    int x = ord[i];
    tag[link[x]] |= (1 << (s[epos[x] - len[link[x]]] - 'a'));
  }
}

int cnt[S][N];
long long ans = 0;

int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int i = 1; i <= n; i++) {
    extend(s[i] - 'a', i);
    cnt[s[i] - 'a'][i] = 1;
  }
  for (int c = 0; c < S; c++)
    for (int i = 1; i <= n; i++)
      cnt[c][i] += cnt[c][i - 1];
  init();
  // printf("> %d\n", tag[ch[1][0]]);
  for (int i = 2; i <= total; i++) {
    for (int c = 0; c < S; c++) {
      if (ch[i][c] == 0) continue;

      int l = epos[i] - len[i] + 1;
      int r = epos[i] - len[link[i]] - 1;
      ans += cnt[c][r] - cnt[c][l - 1];
      if (tag[i] >> c & 1) ans += 1;
    }
  }

  // length = 1
  for (int c = 0; c < S; c++)
    ans += (cnt[c][n] > 0);
  // length = 2
  // std::set<std::pair<char, char>> s2;
  // for (int i = 2; i <= n; i++)
  //   s2.emplace(s[i - 1], s[i]);
  // for (auto it : s2) {
  //   std::swap(it.first, it.second);
  //   if (s2.count(it)) ++ans;
  // }

  printf("%lld\n", ans);
  return 0;
}