#include <bits/stdc++.h>
using namespace std;
int f[200010];
struct Suffix_Automata {
  int minlen[200010], maxlen[200010], trans[200010][26], link[200010], Size,
      Last;
  Suffix_Automata() { Size = Last = 1; }
  inline void extend(int id) {
    int cur = ++Size, p;
    f[Size] = 1;
    maxlen[cur] = maxlen[Last] + 1;
    for (p = Last; p && !trans[p][id]; p = link[p]) trans[p][id] = cur;
    if (!p)
      link[cur] = 1;
    else {
      int q = trans[p][id];
      if (maxlen[q] == maxlen[p] + 1)
        link[cur] = q;
      else {
        int clone = (++Size);
        maxlen[clone] = maxlen[p] + 1;
        for (int t = 0; t < 26; ++t) trans[clone][t] = trans[q][t];
        link[clone] = link[q];
        for (; p && trans[p][id] == q; p = link[p]) trans[p][id] = clone;
        link[cur] = link[q] = clone;
      }
    }
    Last = cur;
  }
};
struct edge {
  int pre, to;
} ed[200010];
int head[200010], cnt;
void merge(int a, int b) {
  cnt++;
  ed[cnt].pre = head[a];
  ed[cnt].to = b;
  head[a] = cnt;
}
Suffix_Automata SAM;
char s[200010];
long long ans;
void dfs(int x) {
  for (int t = head[x]; t; t = ed[t].pre) {
    int l = ed[t].to;
    dfs(l);
    f[x] += f[l];
  }
  if (x > 1)
    ans += 1LL * (SAM.maxlen[x] - SAM.minlen[x] + 1) * f[x] * (f[x] + 1) / 2;
}
int main() {
  scanf("%s", s);
  int gg = strlen(s);
  for (int t = 0; t < gg; ++t) SAM.extend(s[t] - 'a');
  for (int t = 2; t <= SAM.Size; ++t) {
    merge(SAM.link[t], t);
    SAM.minlen[t] = SAM.maxlen[SAM.link[t]] + 1;
  }
  dfs(1);
  printf("%lld", ans);
}
