#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  char ch = getchar();
  bool f = false;
  while (!isdigit(ch)) {
    if (ch == '-') {
      f = true;
    }
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  x = f ? -x : x;
  return;
}
template <typename T>
inline void write(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 ^ 48);
  return;
}
const int N = 2e5 + 5;
long long x, n, last = 1, tot = 1, c[N << 1], q[N << 1];
long long Ans;
bool flag;
char str[N];
struct SAM {
  long long son[26];
  long long fa, len, siz;
} t[N << 1];
void Extend(long long c) {
  long long p = last, np = ++tot;
  last = np;
  t[np].len = t[p].len + 1;
  while (p && !t[p].son[c]) t[p].son[c] = np, p = t[p].fa;
  if (!p)
    t[np].fa = 1;
  else {
    long long q = t[p].son[c];
    if (t[p].len + 1 == t[q].len)
      t[np].fa = q;
    else {
      long long nq = ++tot;
      t[nq] = t[q];
      t[nq].len = t[p].len + 1;
      t[nq].siz = 0;
      t[np].fa = t[q].fa = nq;
      while (p && t[p].son[c] == q) t[p].son[c] = nq, p = t[p].fa;
    }
  }
  t[np].siz = 1;
  return;
}
signed main() {
  scanf("%s", str);
  long long len = strlen(str);
  for (long long i = 0; i < len; i++) Extend(str[i] - 'a');
  for (long long i = 1; i <= tot; i++) c[t[i].len]++;
  for (long long i = 1; i <= tot; i++) c[i] += c[i - 1];
  for (long long i = 1; i <= tot; i++) q[c[t[i].len]--] = i;
  for (long long i = tot; i >= 1; i--) t[t[q[i]].fa].siz += t[q[i]].siz;
  for (long long i = tot; i >= 1; i--)
    Ans += 1ll * (t[i].len - t[t[i].fa].len) * (t[i].siz * (t[i].siz + 1)) / 2;
  write(Ans);
  return 0;
}
